For this problem, we need to write a pseudocode:

Here are sixteen integers: 22, 36, 6, 79, 26, 45, 75, 13, 31, 62, 27, 76, 33, 16, 62, 47. Sort them using (a) quicksort (using 1st element as pivot), and (b) shellsort (using increments 8, 4, 2, 1). Show the result of each sorting step.

Thanks for your time!