Take the input data of the problemfrom a text file (your input will basically be a NxN square matrix of integers and asicallydetermine how much time and memory your programs spend during runtime, and print thisinformation to the output file.(xperiments by choosing the row/column numbers of yourinput matrix as 5, 10, 100, 1000, 10000, 100000, in …

The Hungarian algorithm consists of the four steps below. The first two steps are executed once, while Steps 3 and 4 are repeated until an optimal assignment is found. The input of the algorithm is an n by n square matrix with only nonnegative elements.