![1. [Graph algorithms, 32 Points] Give pseudo-code for the following problems, making sure to state all the relevant data stru](https://media.cheggcdn.com/media%2F5aa%2F5aab812e-88f6-46c9-86fd-58298fd00fa0%2FphpIzqKzD.png)
1. [Graph algorithms, 32 Points] Give pseudo-code for the following problems, making sure to state all the relevant data structures and representations that you assume. You may assume that all the graphs are undirected. a. Give a linear-time algorithm for determining whether a given graph is bipartite. b. Give an O(V)-time algorithm for determining whether a given graph contains a cycle. Note that your algorithm should run in the allotted time for all graphs, whether sparse or
OR
OR