1) Use simple enumeration (forward method) to list all feasible routes from a to h, and the respective cost for each route. Determine the optimal policy by highlighting the optimal route. 2) Apply the principle of optimality to determine the optimal route and the optimal cost. You can use a combination of tables and highlighted routes to show your answers. No need to typewrite your solutions. Handwritten (has to be legible) work is fine. 1 1 1 13 2 1 2
