For each problem below, write your pseudocode directly into the text part of the submittal and provide a link to your replit code.

Complete the following problems below:

In a weighted graph G$,$ its vertices represent cities in a state. The edges represent roads connecting two cities directly. The weight of an edge is the time it takes to travel the road. Write a program that receives an origin city and displays all cities that can be visited during the same day $($that can be visited in less than $24$ hours$).$ Assume that the weights are given in hours. $($LO $9\mathrm{.}1,9\mathrm{.}5,9\mathrm{.}6)$

note: make sure some of the time to travel between cities in greater than $24$ hours, and you should have at minimum $4$ cities. Also in your print$-$out list all the cities and then the cities that can be travelled to in less than $24$ hours.