only solve question 4 , do not give answer to other questions other wise i will dislike it, i urgently only need answer to question 4

Question 1 6 5 15 3 12 10 12 10 2 For a mobile robot to go from point A to B through the possible link points given in the above figure, apply a recursive algorithm for determining the shortest route using Bellman's Dynamic Programming. Question 2 Summarize the principle of optimality in Dynamic Programming. Question 3 Select two problems (other than traveling salesman problem) that can be solved using Dynamic Programming. Summarize the stages and states for the selected problems. Question 4 For the problem given in question 1, how would you apply Genetic Algorithms to solve the