Part A:

Four house leaders are at the Student Union Building $($SUB$)$ when they suddenly realize

that House Dodge Ball is being held at the Currie Center and is starting in $15$ minutes.

Luckily, one of them has a tandem bicycle which will allow two people to ride the

bicycle together. When two people are riding the bicycle together, they can only

travel as fast as the slowest person. One person must then return to the rest of the

group with the bicycle. The Babbage house leader can make the trip in one minute,

the Hopper house leader takes two minutes to make the trip, the Knuth house leader

takes five minutes, and the Turing house leader takes eight minutes. Write an

algorithm that describes how all the house leaders will get to the Currie Center on

time.

Note: the house leaders must remain at the SUB to wait for the bicycle. Walking or

other modes of transportation to the Currie Center is not an option.