Problem 8. (10 points) Imagine that there is a particularly noxious singer (perhaps named Jastin Beeper) who is eurrently in Atlanta, GA. He intends to drive to Los Angeles to put on a concer. You have decided this has to be prevented. Your plan is to put up road blocks. Describe an algorithm to determine the minimum number of road blocks that you need to prevent him from driving to LA. Problem 9. (10 points) Solve the following instances of SUBSETSUM. Give a short justification of your answers s,-(5,8, 11, 17, 24, 29, 37, 41)T,=90 s2=(5,8, 11, 17, 24, 29, 37, 41) Tz=162 Problem 10. (10 points) Arrange the following functions by growth rate (ie each should be big-O of the next): 229m, 2ml2 nlgin), lg(n + ?), VnIg(s). Problem 11. (10 points) Let G be a graph with 10 nodes labeled 1,2 10, edges between node i and j if i divides j or j divides i, and let the weight of edge (i,j) be the lem of i and j. Find the shortest path from node 7 to node 5 and the minimum spanning tree for this graph. Show enough intermediate work that I know you are running an algorithm and not just intelligently guessing