[2B] (Please type and draw your answers digitally).The given table below (1st picture) shows the 5 different places that you would like to visit on a particular day. The table below shows the...

[2B] (Please type and draw your answers digitally).The given table below (1st picture) 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 Edge-Picking Algorithm.

Example (2nd photo) already provided in the photos below
.

Extracted text: H. Grocery Video rental Home Post office store store Bank Required answer: Home 14 12 20 23 12 Post office 8 12 21 14 23 12 17 Grocery store 26 G Video rental 20 12 17 18 store Bank 23 21 11 18 17 21 \11 12 NOTE: THIS IS ONLY A SAMPLE 18 Required answer: Applying the Edge Picking Algorithm, we find the following Hamiltonian circuit with the minimum weight (in minutes): HV – VP – PG – GB – BH, or HVPGBH The obtained minimum time is: 20 + 12 + 8 + 11 + 23 = 74 minutes. | | %3D 14


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 --- Market 20.00 km/h 2.61 km/h 3.33 km/h 3.00 km/h 8.57 km/h