Question $5$: Consider the following network, where numbers on links represents the cost between

the pair of nodes connected by that link. In some nodes such as A and D$,$ due to limited access to

information, costs are unknown and occur based on the probabilities listed on parenthesis. Use

dynamic programming to find the path with minimum cost from the origin $($A$)$ to the destination

$($G$).$