Quicksort is an efficient sorting algorithm developed by British computer scientist Tony Hoare in 1959. One of its implementations is summarised in the pseudo code below with algorithm quicksort and algorithm partition:

algorithm quicksort(A, lo, hi) is

if lo < hi then

p := partition(A, lo, hi)

quicksort(A, lo, p - 1)

quicksort(A, p + 1, hi)

algorithm partition(A, lo, hi) is

pivot := A[hi]

i := lo

for j := lo to hi do

if A[j] < pivot then

swap A[i] with A[j]

i := i + 1

swap A[i] with A[hi]

return i

The algorithm quicksort divides a list of elements into two parts (called sub-lists) and performs sorting over the sub-lists recursively.

The algorithm partition selects a pivot to partition the list into sub-lists such that all elements in one sub-list are smaller than the pivot and all elements in the other are greater than the pivot.

A) Given a list of {51,95,66,72,42,38,62}; illustrate the sorting process specified in the pseudo code (10 marks)

B) Implement the pseudo code in C#