write only the pseudocode and analyze the time complexity ofeach line
Exercise 4 (35 points) 1) (30 points) Write the pseudocode for an algorithm using dynamic programming to solve the activity selection problem based on this recurrence (refer to lecture and textbook) if Si 0 ij F11 0 2) (5 points) Analyze the running time (time complexity) of your algorithm and compare it to the iterative greedy algorithm. Ctri Show transcribed image text Exercise 4 (35 points) 1)
OR
OR