imal study spot. Your main concern is being able to get to each of the building exits as quickly

as possible $($unlike Clemons, strange and unexpected things can happen in Alderman stacks and

you never know which way you may need to exit$).$ You are given a graph G $=($V$,$ E$)$ where each

node v in V represents either a room or an exit. Each edge in the graph represents a doorway

connecting a room to either another room or an exit. From any room, there is a path to every

exit. Your algorithm must find the room $($or rooms$)$ such that the distance to the farthest exit is

minimized.

Give a clear description of an algorithm to solve this problem. State and explain the time

complexity of your algorithm. Base your algorithm design on an algorithm we have studied in

this unit of the course.

Note: you may later decide to find an optimal study spot in one of the other buildings currently being

built, so your algorithm should not be specific only to Alderman$$s new layout! Design your algorithm to

work on any graph of similar style.

For example, in the graph below, the optimal rooms are Room $3$ and Room $5.$ You can get to

either exit from either Room $3$ or Room $5$ by going through at most $2$ doors. Room $1$ would require

going through $4$ doors to get to Exit $2$ and Room $2$ would require going through $3$ doors to get to

Exit $2.$