The snippet of code below uses recursion to compute the minimum integer value stored in an array. Identify the base case and the recursive cases in the method FindMin().

1. Answer (Multiple Choice):
2. (_) The base case in this method FindMin() occurs when the size of the subarray is 2. All other cases are recursive and hence involve recursive calls to FindMin().
3. (_) The base case in this method FindMin() occurs when the size of the subarray is 2 or greater. Recursive cases occur when the size of the subarray is 1.
4. (_) There are no base cases in this method FindMin(). All cases are recursive and hence involve recursive calls to FindMin().
5. (_) The base case in this method FindMin() occurs when the size of the subarray is 1. All other cases are recursive and hence involve recursive calls to FindMin().

Explain your answer:

public int FindMin(int startIndex, int endIndex) \{ int Min=0; int distance =0; int left =0; int right =0; if (startIndex == endIndex) \{ Min =M[ startIndex ]; return Min; \} distance = endIndex - startIndex; left = FindMin (startIndex, startIndex +( distance/2)); right = FindMin ( startIndex +( distance /2)+1, endIndex ); if (left