Please explain everything! show work! please...

Trace the Partition algorithm for the following list:Consider the merge of two sorted arrays $A[0..p-1]$ and $B[0..q-1],$ where $C_{1}AB{C}_1{C}_{2}AB{C}_{2}p.$

$(a)$ What $is$ the minimum number $C_{1}of$ comparisons $to$ merge A and $B?$ What

kind $of$ input data need $C_1$ comparisons.

$(b)$ What $is$ the maximum number $C_{2}of$ comparisons $to$ merge A and $B?$ What

kind $of$ input data need $C_2$ comparisons.

$(16,7,28,4,31,22,25,10,18,13,40,5,11,39).$