Designing an algorithm (pls provide pseudocode and clear explanation). Thank you!

Problem 2. Trip planning (10 points) You are planning a vacation in a faraway country, and are looking at the train schedules in that country. The train schedule is made up of a set of n 4-tuples. train(i)=(depcity(i),arrcity(i),dep(i),arr(i)) In the above schedule, depcity and arrcity are the cities that train i leaves from and arrives in, respectively, and dep and arr represent the time that it does those two things. Basically, train i leaves depcity (i) at time dep(i), and arrives in arrcity(i) at time arr(i). Suppose you want to start at time 0 in a particular city, and wanted to see how quickly you could get to each city from your starting city. Write an algorithm to efficiently solve this problem, and explain why it is correct. Remember that this is a train schedule, and so you cannot catch a train if you arrive later at a city than it leaves. The algorithm takes as input the id of the city you start from as well as the 4-tuples