Compute the eigenvalue decomposition of M T M $($Use scipy.linalg.eigh func$-$ tion in Python$).$ The function returns two parameters: a list of eigenvalues $($let us call

$1$A matrix U in Rp$$q is column$-$orthonormal if and only if UT U $=$ I where I denotes the identity matrix

$2$Other implementations of SVD and PCA might give slightly different results. Besides, you will just need fewer than five python commands to answer this entire question

$2$

this list Evals$)$ and a matrix whose columns correspond to the eigenvectors of the respec$-$ tive eigenvalues $($let us call this matrix Evecs$).$ Sort the list Evals in descending order such that the largest eigenvalue appears first in the list. Also, re$-$arrange the columns in Evecs such that the eigenvector corresponding to the largest eigenvalue appears in the first column of Evecs. What are the values of Evals and Evecs $($after the sorting and re$-$arranging process$)?$