Tom and Carol are playing a game in which each round, the winning player scores either...

Transcribed Image Text:

Tom and Carol are playing a game in which each round, the winning player scores either 2 or 3 points. After many rounds Tom has a score of 15. We would like to determine the fewest number of rounds that Tom could have won to have a score of 15. (a) Formulate this problem as a shortest path problem. Draw the graph including the weights on the edges. Indicate the starting vertex and ending vertex. (b) Determine the shortest path in the graph from part (a). What is the fewest number of rounds that Tom could have won to have a score of exactly 15. Tom and Carol are playing a game in which each round, the winning player scores either 2 or 3 points. After many rounds Tom has a score of 15. We would like to determine the fewest number of rounds that Tom could have won to have a score of 15. (a) Formulate this problem as a shortest path problem. Draw the graph including the weights on the edges. Indicate the starting vertex and ending vertex. (b) Determine the shortest path in the graph from part (a). What is the fewest number of rounds that Tom could have won to have a score of exactly 15.