Java

Part 1:

Part 2:

Part 3:

Part 4:

Write a recursive method called countMatchesInRange.

The method returns how many numbers between two positions (both inclusive) of an array match a target value

The method header is:

public int countMatchesInRange(int[] numbers, int start, int end, int value)

For example:

int[] a = {5, 2, 3, 2, 2, 1, 2};

int n = countMatchesInRange(a, 1, 4, 2);

// n stores 3

int m = countMatchesInRange(a, 0, 6, 2);

// m stores 4

You can include private, recursive helper methods if needed.

It is always possible to convert an iterative algorithm to a recursive algorithm O true false