Thankyou

3. An adjacency matrix of a graph is given below: 011101 100111 100111 111010 011101 1010 First, draw the graph defined by that adjacency matrix, and label the vertices of the graph with 1, 2, 3, ..., 6 so that vertex i corresponds to row and column i. Second, Give a coloring of the vertices (color the graph) that uses the minimum number of colors. Prove with explanations that your given coloring is the minimum coloring. 4. Suppose there is a maze with a starting point and endpoint. You have to start from the starting point, walk into the maze. If you hit a wall, of course you mst go back and find another way until you reach the endpoint. You may represent the maze using a 2-dimensional array. For example, in the maze below: cell (H,F) and (1,D) hits a wall. The maze can be random. Your task is to write a backtracking algorithm/pseudocode to solve this maze problem. Maze creation is not necessary. A B C D E F G H I End A start B D E F G H 1 J K L M N 1. Consider the following function. What is the purpose of the function f? Please do explain and describe in details all possible answers for this function given below. int f(int n) { if ((a >= b) && (c = b) return f(a, c, b); else return fb, a, c); } a. To find the maximum number between a, b, and c. b. To find the middle number between a, b, and c. c. To find the minimum number between a, b, and c. d. None of the other statements