Question 4 1 pts For Chained Hash, if we store n items in a hash table with p slots, what is the worst possible complexity of searching a certain item? O O(n) (p) (n*p) (n/p) Question 5 1 pts If we have 5 people and their birthdays are distributed uniformly across the year (including leap day), what is the probability of finding at least 2 people who share a birthday? 0.0403536 O 0.0270621 O 0.0163114 05/366 Question 6 1 pts In the Coupon Collector problem introduced in class, what is the expected number of draws required to collect the entire set of unique coupons (size=n)? O O(n^2) O(nlogn) O O(n) O(1)