Follow the quick sort algorithm that was described in class…

Follow the quick sort algorithm that was described in class was used with the pivot being the last element in the array 18, 4, -5, 16, 23, -9, 12, 8, 7, 5. Answer the following questions based on the running of quick sort: [1] What elements are stored in the “left” array after the first initial call? Be sure to list the elements in the order they would be in the array. Separate elements by 1 space only. This question is autograded so formatting/spacing is important. [2] What elements are stored in the “right” array after the first initial call? Be sure to list the elements in the order they would be in the array. Separate elements by 1 space only. This question is autograded so formatting/spacing is important.  

Consider the following binary tree. In your answers, separat…

Consider the following binary tree. In your answers, separate your elements by one space only. This question is autograded so formatting/spacing is important.   Write the elements of the tree below in the order they would be seen by a pre-, in-, and post-order traversal. In-order: [a1] Pre-order: [a2] Post-order: [a3]

A hash table of length 10 uses open addressing with hash fun…

A hash table of length 10 uses open addressing with hash function h(k) = k % 10, and separate chaining. After inserting several values into an empty hash table, the table is as shown below.  0 1 2 42 3 23 4 5 55 6 46 7 8 9 At what index will the value 12 be inserted?