) QuickSort: Given the following unsorted array of characters to start: (18 pts)

[0]	[1]	[2]	[3]	[4]	[5]	[6]	[7]	[8]	[9]
N	E	K	W	D	Y	Z	B	M	G

and using the first quick sort algorithm from the online Content (with the first /leftmost value as the pivot value):

For each call (label as call 1, call 2a, call 2b, etc.) going forward:

Identify the call indexes and the pivot value

State which values will be swapped during partitioning

Show the array after partitioning, with the pivot value highlighted, and correct values on the left and on the right of the pivot

List the recursive calls that are made from the call