Question:
(a) (i) Explain what do you understand by ‘Dynamic Programming'.
(ii) Describe the dynamic programming approach to solve the shortest route problem.
(iii) Outline the dynamic programming algorithm to solve a dynamic programming problem.
(b) What do you understand by the term ‘Information Processing Theory'? Explain how the information processing theory can be related to the computer model.