Algorithm Question:

You arrive at Waldo's World Amusement Park with T minutes before the park closes. The park has n rides and your objective is to complete as many rides as possible before the park closes. You are given a table W such that W(i,t) gives you the waiting time for ride i at time t. For convenience, assume that t is to be given as minutes before the park closes. Ride i itself takes r_i minutes and all times are measured in integer minutes.

a) Give your solution with dynamic programming technique.

b) Describe your idea, algorithm (Pseudo code is ok)and analyze the complexity of your algorithm.