String wordMatch and integer numData are read from input. Then, numData alphabetically sorted strings are read from input and each string is added to an ArrayList. Complete the findMiddle$()$ method:

$si{n}^2$

$2$

If wordMatch is found at index middielndex of the ArrayList, output wordMatch, followed by $"$ is found at index $"$ and the

$$

$3$

value of middlelndex.

Else if rangeSize is $1,$ output wordMatch, followed by $"$ is not in the list".

Otherwise, output wordMatch, followed by $"$ is not found at index $"$ and the value of middlelndex.

$$d each output with a newline.

Click here for example

Note:

str$1.$equals$($str$2)$ returns true if str$1$ is equal to str$2,$ and returns false otherwise.

No recursive call is needed.