1. (8 Points) Assume that the letters of your First name and Last name are stored in a character array (ignoring spaces and all characters which are not from the English alphabet.

For example, if your name is: Abdulhameed Althani the array contents will be:

A, b, d, u, l, h, a, m, e, e, d, A, l, t, h, a, n, i

What will be the array contents looking like in the following situations:

1) after calling the partition method three times in quick sort if pivot is the first element.

2) after two calls of the merge method in merge sot

Note: ignore letter case (i.e. 'A' and 'a' , 'B' and 'b' , , 'Z' and 'z' are considered the same

2. (5 Points) Draw a complete binary tree with exactly 8 nodes. Put a different value in each node. Then draw an array with eight components and show where each of the eight node values would be placed in the array (using the usual array representation of a complete binary tree).