Answer:
ACBD; 7
Step-by-step Explanation:
The Route Algorigtm finds the short route that is efficient, in order to find the solution following pathways.
From the pictures from the complete question,
STEP #1, there exist, three routes, which are:
AB
AC,
and AD.
*AB is not viable because of the negative distance, so it can be removed .
* the AC distance is 3,and AD distance is 8. Therefore, AC can be selected and circled.is because of AC efficiency is high compare to AD.
*from selected AC, the possible routes are ACB; 3 and ACE; 6. which are route shown in #2
* ACB is circled, because it's more shorter than ACE
*The possible routes are ACBE; 8 and ACBD; 7. which are route shown in #3 . Therefore, route ACBD is circled because it's more shorter.
From the analysis of the algorithm, the route ACBD route is the shortest and the most efficient
![PV=C*[\frac{1-(1+i)^{-n}}{i}]*(1+i)](https://tex.z-dn.net/?f=PV%3DC%2A%5B%5Cfrac%7B1-%281%2Bi%29%5E%7B-n%7D%7D%7Bi%7D%5D%2A%281%2Bi%29)
![PV=3000*[\frac{1-(1+0.12)^{-6}}{0.12}]*(1+0.12)=3000*[\frac{1-0.5066}{0.12}]*1.12=](https://tex.z-dn.net/?f=PV%3D3000%2A%5B%5Cfrac%7B1-%281%2B0.12%29%5E%7B-6%7D%7D%7B0.12%7D%5D%2A%281%2B0.12%29%3D3000%2A%5B%5Cfrac%7B1-0.5066%7D%7B0.12%7D%5D%2A1.12%3D)
![=3000*[\frac{1-0.5066}{0.12}]*1.12=3000*4.1114*1.12=13814.32](https://tex.z-dn.net/?f=%3D3000%2A%5B%5Cfrac%7B1-0.5066%7D%7B0.12%7D%5D%2A1.12%3D3000%2A4.1114%2A1.12%3D13814.32)