$3.$ Bill has an algorithm, find$2$D$,$ to find an element x in an n x n array A$.$ The algorithm find$2$D iterates over the rows of A and calls the algorithm arrayFind, of Algorithm $1\mathrm{.}3\mathrm{.}2($ZyBooks$),$ on each one, until x is found or it has searched all rows of A$.$ What is the worst$-$case running time of find$2$D in terms of n$?$ Is this a linear$-$time algorithm? Why or why not