A postal delivery network is given below. A link between some location A and some location B is associated with a value representing the reliability of that delivery from A to B. For example, if the person with the mail (lets call it A) goes directly to a post box (lets call it B) the mail will be successfully delivered to B with a probability of 0.4. An algorithm is required to find the most reliable delivery path between two given locations.

1. Define the problem in graph notation. (5 pts)
2. Define an algorithm in pseudocode to solve the problem. (10 pts)
3. Apply your algorithm to find the most reliable path starting at location A (i.e. the person with the mail ) to the destination home address . What is the reliability of that path? (10 pts)

CI 0.1 0.4 0.2 Ptt 0.3 0.7 0.8 Ptt 0.1 0.2 0.5