The minimal completion time for the activities is the shortest possible time for all the activities to be finished. In doing this, we look at the path that would require the greatest amount of time. At the START node, we choose the path that would take the longest which is 7 days leading to ACTIVITY D. Next, we choose the path leading to ACTIVITY B which takes 5 days. Then, we move to ACTIVITY C taking 5 days and finally, reach the END which would take 6 days. So, the minimal completion time is:
7 + 5 + 5 + 6 = 23 days
<h3><u>Answer</u> :</h3>
![\bigstar\:\boxed{\bf{\purple{x^{\frac{m}{n}}}=\orange{(\sqrt[n]{x})^m}}}](https://tex.z-dn.net/?f=%5Cbigstar%5C%3A%5Cboxed%7B%5Cbf%7B%5Cpurple%7Bx%5E%7B%5Cfrac%7Bm%7D%7Bn%7D%7D%7D%3D%5Corange%7B%28%5Csqrt%5Bn%5D%7Bx%7D%29%5Em%7D%7D%7D)
Let's solve !
![:\implies\sf\:(\sqrt[2]{25})^3](https://tex.z-dn.net/?f=%3A%5Cimplies%5Csf%5C%3A%28%5Csqrt%5B2%5D%7B25%7D%29%5E3)
<u>Hence, Oprion-D is correct</u> !
The answer is B. 5.3 miles per day * 17 days = 90.1 total miles.
