Recall the quickselect algorithm used for quickly finding the median of an array. Suppose

you ran quickselect on the following array to find it$$s median.

$1278131974548268510078$

$1.$ Suppose you always pick the first element as the pivot. List the all the subarrays that

quickselect recurses on$,$ as well as the index k $$ the k smallest element of the current

subarray which the algorithm returns.

For example, quickselect begins on the entire array $[12,78,13,1,97,45,48,26,85,$

$100,78]$ and k $=6.$