Prove using an inductive argument that for every input array of length n$,$ the al$-$ gorithm QuickSort correctly sorts it$,$ i$.$e$.,$ provide a proof of correctness for the algorithm. For convenience, you can assume that the pivot is chosen as the median element.