which graph theory problem they are trying to solve on this graph.

4, we say a matrix has dimensions m n if it has m rows and n columns. If matrix A has dimensions x y and inatrix B has dinensionszxto, then the product AB exists if and only if y = z. In the case where the product exists, AB will have dimensions x w. In this problem we are given a list of matrices and their dimensions, and we want to determine if there is an order in which we can multiply all the matrices together, using each matrix exactly once. The list of matrices and their dimensions is as follows: Als 4 5, B is 5 x 7, cis 5 4, Dis47, E is 7 x 5 (a) (4 points) Draw a graph that represents this situation in such a way that finding an order we seek corresponds to finding a Hamilton Tour of your graph. Describe what the vertices of your graph represent, and when two vertices are connected with an edge b) (4 points) Draw a different graph that represents this situation in such a way that finding an order we seek corresponds to to finding an Euler Tour of your graph. Describe what the vertices of your graph represent, and when two vertices are connected with an edge. (e) (2 points) Give an order in which we can ultiply these matrices, or say that no such order exists