Problem 2. We have seen that the following two problems are both in NL: (i) BIPARTITE: Decide if an input graph G is bipartite. (ii) PATH: Given input G, s, t, decide if there is a path between s and t in G. Consider now the PATH-ON-BIPARTITE problem where given an input G, s, t we want to output yes if and only if G is bipartite, and there exists a path between s and t on G. Is this problem in NL (non-deterministic logspace), yes or no? Fully justify your answer. Problem 2. We have seen that the following two problems are both in NL: (i) BIPARTITE: Decide if an input graph G is bipartite. (ii) PATH: Given input G, s, t, decide if there is a path between s and t in G. Consider now the PATH-ON-BIPARTITE problem where given an input G, s, t we want to output yes if and only if G is bipartite, and there exists a path between s and t on G. Is this problem in NL (non-deterministic logspace), yes or no? Fully justify your