Using the same style as the below code. Implement quicksort in python using the median-of-three partitioning

def partition(elements,low_idx,high_idx): i=low_idx-1 pivot_elt=elements[high_idx] for j in range(low_idx,high_idx): if elements[j]

def quick_sort(elements,low_idx,high_idx): if len(elements)==1: return elements if low_idx < high_idx: idx=partition(elements,low_idx,high_idx) quick_sort(elements,low_idx,idx-1) quick_sort(elements,idx+1,high_idx)

elements=[] n = int(input("Enter the total number of elements:")) print("Enter the elements") for i in range(0,n): element=int(input()) elements.append(element); quick_sort(elements,0,n-1); print(elements)