a) Describe the basic concepts of dynamic programming. [6 Marks] b) Given the following network programme of traveller from City A (Node 1)and City B (Node 11): Where ROUTE 1-2 travel time for each section is given as: Hrs of Travel 15 hrs 1-3 2-4 2-5 3-5 21 hrs 18 hrs 15 hrs 12 hrs 3-6 18 hrs 4-7 27 hrs 4-8 30 hrs 5-8 24 hrs 5-9 30 hrs 6-9 24 hrs. 6-10 21 hrs 7-11 21 hrs 8-11 15 hrs 9-11 18 hrs 10-11 27 hrs. 10 11 Using dynamic programming solution, determine the route from City A and City B that involves the minimum travel time. [9 Marks]