Solve PART C only and read the previous ones to get a better understanding only. I want you to define what is the five color theorem. And prove the problem in part C above using the five color theorem. Please do explain the theorem in details to get a better understanding and how we applied it on PART C

IRECTED GRAPHS" I BELIEVE THIS SHOULD READ "DIRECTED AND UNDIRECTED GRAPHS" You work for a startup intercity coach company as a driver. Currently your route consists of 5 stops one way including your origin. Fully describe a provided graph and using Dijkstra's algorithm, find the shortest possible route. The coach company you work for has seen great success! There are now 15 destinations to visit. They have taken on four new drivers, Greta Green, Bernie Blue, Ricky Red and Walter White, and you have been promoted to logistics manager. Your first initiative is to implement a continuous cyclic route which visits all the destinationsfor one driver, to do this you will need to evaluate the cycles available in the graph. Secondly, you want to distribute 3 one-way trips across the remaining drivers. Do different colorization techniques produce different results? The newly open Business Intelligence team has recently been in contact to say that they have projected by the end of the year the business will have grown to 25 destinations and will need an additional two drivers, and within five years grown to 50destinations with 11 drivers overall. Prove to them that, discounting the circuitous route, no more