7. Linear probing a. is used to insert values into a doubly linked list. b. is a method of resolving collisions which uses chaining in a hash table. c. searches linearly thru the table starting at the location specified by the hash function. d. none of the above. 8. A data structure which exhibits LIFO behavior is known as An array. b. A stack. C. A vector. d. None of the above. 9. Assume we have a queue implementation which is based on using an array. We have front and back variables which identify the positions in the array where items are removed or added. The size of the array is defined by a constant named SIZE. The queue is defined to be empty when front back. When adding an item to this queue, how would you tell when the queue was full? a. if ((back 1)% SIZE front the queue would be full b. if ((front 1) SIZE back) the queue would be full c. if ((back 1) front) the queue would be full d. if ((front 1) back) the queue would be full 10. In an array-based heap, assuming heap entries start at index 1.the right child of node n is at index a. 2n b. n c, n/2 d. 2n+1 e. n/2 11. In quick sort, the partition step takes at most comparisons for n items. a, n b. n/2