<p style="margin-left:0px;margin-right:0px;">Written Java, Big-ONotation</p><p style="margin-left:0px;margin-right:0px;"><img alt="(13 points) Assuming the above definition of contains, what is the Big-O time complexity of this algorithm as a function of n, the size of