NOTE: for j Your colleague has partially implemented an algorithm to test if a strongly connected graph is bipartite (can be 2-colored). Pseudo-code for her algorithm is presented below. Your colleague has won the lottery and decided to leave university, so it is up to you to finish the algorithm. Unfortunately, she did not define the data structure for the variable X. However, you can tell from the documentation that the data structure was supposed to be either a stack or a queue. Will a stack data structure or queue data structure produce the correct answer? Provide an adjacency matrix for a small graph that causes the other data structure to either return the wrong result or not terminate. (a 3 node graph is sufficient)