Question 13 Papa Mario of Mario's Pizzeria has baked a huge pizza and cut it into n slices, but he is clumsy and the pizza wasn't evenly sliced. Then slices have size s, There are n hungry students who each want to eat a slice of pizza. Suppose the ith student would be happy with any slice whose size is at least t, Give an efficient algorithm to determine whether it is possible to distribute the pizza slices so everyone is happy (o) What algorithm paradigm is most appropriate for this problem? Divide-and conquer Greedy algorithm Dynamic Programming Linear Programming Graph Algorithm e None of these b) Verbally describe an efficient algorithm to solve this problem (c) What is the asymptotic running time of your algorithm