Hansel and Gretel are playing a game in which the winning player scores either 2 or 3 poi nts in each round. Gretel has a score of 15 after several rounds. We want to find out th e fewest number of rounds Gretel should have won to score 15. a. b. c. Formulate the problem as a shortest-path problem. Draw the graph with edge weights. Specify initial vertex and ending vertex. What is the fewest number of rounds that Gretel should have won to score exactly 15 (Use dynamic programming for this problem)? Suppose we want to find all paths that are at most 20% worse than the optimal path length. How can you solve this problem in the light of dynamic programming? Please find the three of them for simplicity (not all paths) by using your procedure.