6. You have been given an unweighted and undirected graph G=(V,E), and an edge eE. a. Your task is to devise an algorithm to determine whether the graph G has a cycle containing that specific given edge e. Also, determine the time complexity of your algorithm and justify your answer. Note: To become eligible for full credits on this problem, the running time of your algorithm should be bounded by O(V+E). b. Will your algorithm still work if the graph is unweighted but directed? If not, how would you modify your algorithm to make it work on an unweighted-directed graph