Home Hospital Mall Esplanade Pet Shop Home 2.00 km/h 4.00 km/h 3.53 km/h 6.00 km/h Hospital 2.00 km/h 3.53 km/h 3.00 km/h 2.40 km/h Mall 4.00 km/h 3.53 km/h 30.00 km/h 2.40 km/h Esplanade 3.53 km/h...

[(2A)] The given table below (in the first photo) shows the 5 different places that you would like to visit on a particular day. The table below shows the estimated distance (in kilometers per hour) it takes you to travel from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Greedy Algorithm.
Example (second photo) already provided in the photos below
..

Extracted text: Home Hospital Mall Esplanade Pet Shop Home 2.00 km/h 4.00 km/h 3.53 km/h 6.00 km/h Hospital 2.00 km/h 3.53 km/h 3.00 km/h 2.40 km/h Mall 4.00 km/h 3.53 km/h 30.00 km/h 2.40 km/h Esplanade 3.53 km/h 3.00 km/h 30.00 km/h 2.22 km/h Pet Shop 6.00 km/h 2.40 km/h 2.40 km/h 2.22 km/h ---


Extracted text: Grоcery Video rental Home Post office store store Bank Required answer: 12 Home 14 12 20 23 Post office 14 8 12 21 14 Grocery 12 17 11 23 20 store Video rental 20 12 17 18 8. store Bank 23 21 I1 18 17 21 11 12 NOTE: THIS IS ONLY A SAMPLE 18 B Required answer: Applying the Greedy Algorithm, we find the following Hamiltonian circuit with the minimum weight (in minutes): HG – GP – PV – VB – BH, or HGPVBH The obtained minimum time is: 12 + 8 + 12 + 18 + 23 = 73 minutes. |