$1.$ Implement the master method theorem Sample Input: T$($n$)=3$T$($n$/2)+$ n$2$ Sample Output $=$ O$($n$2)2.$ Implement the BFS algorithm Input: You have to provide a graph either using adjacency matrix or adjacency list Output: You have to show distance and previous node of each vertex from a specific source node $3.$ Implement the DFS algorithm Input: You have to provide a graph either using adjacency matrix or adjacency list Output: You have to show discovery and finishing time of each vertex from a specific source node $4.$ Implement the Topological sort algorithm Input: You have to provide a graph either using adjacency matrix or adjacency list Output: You have to show the sorted order of each event