Question: Question 2: City Bus Tour Problem City buses are a popular way for city sightseeing. There are many attractions along the way, and the tourists
Question 2:
City Bus Tour Problem City buses are a popular way for city sightseeing. There are many attractions along the way, and the tourists want to see as many attractions as possible. Imagine a constraint bus tour in which the bus is allowed to move either to the south or to the east, but even so, it can choose from many different paths.

The map above represents a traditional market tour in Seoul and can also be represented as a grid (see below) with the numbers next to each line (weights) showing the number of attractions on every block. The tourists must decide among the many possible paths between the north-westernmost point (the green source vertex) and the south-easternmost point (the yellow sink vertex). The weight of a path from the source to the sink is the sum of weights of its edges, or the overall number of attractions.

Design a greedy solution for the above grid representing the City Bus Tour Problem.
Write pseudocode to solve the City Bus Tour Problem using dynamic programming. What is your recurrence?
Rewrite the recurrence to solve the grid shown below:

Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
