I need this in Python code

Another fundamental problem in linear algebra is the "eigenvalue problem": Given a square matrix A, find an "eigenvalue" a number) and an "eigenvector" I that satisfy the equation Az = 12 There is a unique eigenvector in for every unique eigenvalue In. An N N matrix has at most N unique eigenvalues. We will only be interested in a special class of matrices called "hermitian matrices." The symmtric matrices we have been constructing by adding a matrix to its transpose are hermitian matrices. Write a function that takes a single integer n as its argument and returns an N x N symmetric random matrix