4. Suppose you had n matrices with dimensions: ax b.a2 b2, . . . , an bn. Your goal is to determine, given two integers s and t, whether it is possible to multiply a sequence from the list of given matrices together, in any order and possibly not using all of the matrices, to end up with a matrix with dimensions s t. For example, if the list of matrix dimensions is A : 3 x 5, B : 5 x 7, C : 7 9, D : 9 x 5, E : 9 x 3, and F:7x5 we can construct a 9 x 9 matrix as E ABC (13 points for correct algorithm description, 6 for correctness proof, and 6 for efficiency and time analysis,). 4. Suppose you had n matrices with dimensions: ax b.a2 b2, . . . , an bn. Your goal is to determine, given two integers s and t, whether it is possible to multiply a sequence from the list of given matrices together, in any order and possibly not using all of the matrices, to end up with a matrix with dimensions s t. For example, if the list of matrix dimensions is A : 3 x 5, B : 5 x 7, C : 7 9, D : 9 x 5, E : 9 x 3, and F:7x5 we can construct a 9 x 9 matrix as E ABC (13 points for correct algorithm description, 6 for correctness proof, and 6 for efficiency and time analysis,)