2. QuickSort a) Given the initial array to be sorted using the QuickSoxt algorithm show in the table provided for each step, the variables values, the swaps (use variables values e.g. swap 23, 22) and QuickSort recursive calls (use indexes, sg QuickSot(A, 0, 1)). Use NA when FU goes out of range. Repeat the same process as in a) on the following array 50 steps AlO] A1AI21 A[3] Al4 Swaps/Quicksort calls PivotFLasts1 b) 36 34 25. What are your observations? FU L initial 34 1250 36 25 34 25 2 4 5 6 7 8 9 10 12 13 14 15 16 1225343650Sorted Array