user
Instruction: Design a program that can find the kth smallest element in an array.
Output:
assistant
def kthSmallest(arr, n, k): 
    # Sort the array 
    arr.sort() 
    # Return k'th element in the sorted array 
    return arr[k-1] 
  
# Driver Code 
# Output should be 5
arr = [12, 3, 5, 7, 19] 
n = len(arr) 
k = 3
print(kthSmallest(arr, n, k))