For this for loop in Java:

public static int look(int[] array, int value) { for (int i = 0; i < array.length; i++) { if (array[i] == value) { return i; } } return -1; }

1) How many statements would be executed in a call to look() when the array size is zero (n ==0)?

2) Best Case Scenario. Under what conditions would the minimum number of statements be executed for an array where n is large? Where would the target element be located in the array? What is the growth function under these conditions?

3) Worst Case Scenario. Under what conditions would the maximum number of statements be executed for an array where n is large? Where would the target element be located? What is the growth function under these conditions?

Please show how you got to each answer. Thank you.