The following image shows a graph with 7 vertices (nodes) labelled from 1 to 7 and edges connecting some of the vertices. 3 6 The adjacency matrix of a graph is the matrix A = (Aij) with Aj = 1 if there is an edge connecting the vertices i and j and Aij = 0 otherwise. Set up the adjacency matrix of the above graph and assign it to the variable adjacency_matrix. Represent the matrix as a list of lists such that adjacency_matrix[i-1][j-1] corresponds to Aij. Thereafter, define a function vdeg that takes an adjacency matrix (in the same format) and returns a list of the degrees of the vertices. The degree of a vertex is the number of other vertices that it is connected to. Use the function vdeg to determine the degrees of all vertices of the above graph and store the result in the variable example_degrees.

Just the default matrix (2D vector)

MATLAB: Create a vector named n which starts at -10 and steps by 1 to end at +10 by using the start:step:stop syntax. Next, generate a vector x1 so that x1 satisfies the mathematical relationship ?ଵ[?]=(0.60). Since n is a vector, one will need to utilize 0.60.^n (i.e., .^ is used in place of ^) to define x1. Redo the work just completed, but for a vector x2 where x2 satisfies the mathematical relationship ?ଶ[?]=(0.85). Repeat the work just completed, but for a vector x3 where x3 satisfies the mathematical relationship ?ଷ[?]=(1.10).  In one figure window, plot x1 as a function of n using the stem command. The stem plot must show BLACK (versus the default blue) lines that have filled circles and a line width of 2; refer to the lecture example script file. Further, the horizontal axis label (xlabel) must be n, the title (title) must include your name and the vertical axis label (ylabel) must show ?ଵ[?]=(0.60)(note the subscript and superscript). In addition, turn on the grid (doc grid),…

Please debug the following trenchTranveral javascript function. The function should return true if the node's value is less than -5 and false if equal to or greater than -5.     function findNeighbors(node, matrix) { const neighbors = []; const [row, col] = node; const currNum = matrix[row][col]; // Check top if (matrix[row - 1] && Math.abs(matrix[row - 1][col] < - 5)) { neighbors.push([row - 1, col]); } // Check bottom if (matrix[row + 1] && Math.abs(matrix[row + 1][col] < - 5)) { neighbors.push([row + 1, col]); } // Check left if (matrix[row][col - 1] && Math.abs(matrix[row][col - 1] < - 5)) { neighbors.push([row, col - 1]); } // Check right if (matrix[row][col + 1] && Math.abs(matrix[row][col + 1] < - 5)) { neighbors.push([row, col + 1]); } // Return neighbors return neighbors; // Only consider N, S, E, W nodes } function trenchTraversal(node, matrix, visited) { const [row, col] = node; let stack = [node] visited.add(node.toString())…