Standard disclaimer: your solution should use the algorithms…
Standard disclaimer: your solution should use the algorithms from class (DFS, BFS, Dijkstra’s, Topological Sort, Bellman-Ford, Floyd-Warshall, SCC, Kruskal’s, Prim’s, Ford-Fulkerson, Edmonds-Karp, and 2-SAT) as a black box subroutine for your algorithm. If you attempt to modify one of these algorithms you will not receive full credit, even if it is correct. Make sure to explain your algorithm in words (no pseudocode!), explain the correctness of your design, and state and analyze its running time. Faster—and correct—solutions are worth more credit. The most popular class at GaTech, CS59 Algorithms the Cuban Way, is held in multiple auditoriums. The instructor claims that a student, no matter where they are on campus, can reach an auditorium to attend the lectures.You are given a directed graph G = (V, E), where each vertex represents a building on campus, and each edge is a one-way path connecting two buildings. You are also given a list L, such that for any building i, L is true if it has an auditorium where CS59 is offered, and false otherwise.Design an algorithm that verifies if the instructor’s claim is true, and returns false otherwise.