In your Java class, develop a class method that meets the following requirements:

$($a$)$ has a signature matching int methodName$($int$[]$ array, int searchkey$),$

finds and returns the integer index of sports player number searchkey in the

array array $($if it exists$)$

The signature of a Java method includes its name and the types of its formal

parameters. For example, the formal parameter types of this method are integer

array and integer

$($b$)$ has the best Big Oh complexity you can achieve based on the search tech$-$

niques learned in the efficient algorithms module. In comments above the

method, explain what you believe your method$$s Big Oh complexity is $($con$-$

stant, logarithmic, linear, quadratic...$)$ and why