Describe how to optimize quicksort so that the Q(n^2) worst-case run time behavior does not occur. Describe how do vector lists and linked lists differ. What would make you choose to implement one over the other in your programs? What are the conditions that can cause rotations in AVL Binary Search Trees? What is the difference between Prim's and Kruskal's algorithms for generating minimum spanning trees? Design an implementation of a queue using two stacks. What are the time complexities of the push and pop operations