Young tableaux. Suppose you have an \(n\)-by- \(n\) array of integers a [] [] such that, for all \(i\) and \(j, a[i][j]

A two-dimensional array with this property is known as a Young tableaux. Write a function that takes as arguments an n-by-n Young tableaux and an integer, and determines whether the integer is in the Young tableaux. The order of growth of the running time of your function should be linear in n.

5 23 54 67 6 73 83 83 89 74 90 10 84 91 60 73 84 86 92 89 91 92 93 94 69 69 71