answer of both the questions

Problem 2: suppose Quicksort always splits the array given into 20% and 80% parts. Draw a recurrence tree for this situation, and compute its complexity. Problem 3: Consider a Hashtable with records r-1,100 and the number of slots n-1,500. Given: n-1500 ?1100 a. What is the packing density'? Packing density-11001500-73.33% b. Find the expected number of slots with no of records hashing to them. c. Find the expected number of colliding records in the Hashtable