Muddy city problem Once upon a time there was a city that had no roads. Getting around the city was particularly difficult after rainstorms because the ground became very muddy cars got stuck in the mud and people got their boots dirty. The mayor of the city decided that some of the streets must be paved, but didn't want to spend more money than necessary because the city also wanted to build a swimming pool. The mayor therefore specified two conditions: 1. Enough streets must be paved so that it is possible for everyone to travel from their house to anyone elses house only along paved roads, and 2. The paving should cost as little as possible. Here is the layout of the city. The number of paving stones between each house represents the cost of paving that route. TALK 1. Develop a network diagram to solve this problem (Hint: You will have to assign path weights using the number of stones connecting houses) 2. Find the best route that connects all the houses, but uses as few counters (paving stones) as possible (Hint: You can use MST algorithms to solve this problem because shorter the span--> fewer stones are used) You have to submit one Excel file with three sheets in it. Sheet 1: Include the initial network diagram (before highlighting the paths to be paved) Sheet 2: The solution you got using Excel QM add-in Sheet 3: Final network diagram with paths to be paved clearly highlighted, and the total distance