Define mult, inv, solve as the algorithms defined as follows: - trans is the algorithm that takes a matrix A as an input and returns its transpose A. - mult is the algorithm that takes matrices A,B as inputs and returns the matrix product AB straightforwardly as in NumPy's dot function. - inv is the algorithm that takes a regular matrix A as an input and returns the inverse matrix using the LU decomposition. - solve be the algorithm that takes matrices A,B with the same number of columns as inputs and return the solution X of the equation AX=B using the LU decomposition. Let A,B are real nn matrices, which are denoted by A and B in pseudocode. Which of the following calculates A1B correctly and most efficiently in terms of the time computational complexity? Here, assume that A,B have no special structure and the LU decomposition of A and B exists. Choose one from the following options. (a) mult(inv(A), B) (b) mult(A,inv(B)) (c) Solve(A, B) (d) trans(solve(trans(B),trans(A))) (e) None of the above gives the correct answer. Choose one from the above options and type your answer (one alphabet letter) in the following box