Problem Description:

Complete the implementation of the isSubarray$()$ method in SubarrayChecker.java. This method

should determine whether $B$ is a subarray of $A.$ An array $B$ is considered a subarray of array $A$

if all the elements in $B$ appear in $A$ in the same order. A and $B$ are integer arrays.

If $B$ is not a subarray of $A,$ return False. If $B$ is a subarray of $A,$ return True along with all the

starting indices where $B$ can be found in $A.$ It should be noted that if there are multiple indices

that satisfy the condition, all satisfying indices should be returned as an array.

Examples:

Input: $A=[1,2,3,4,5],B=[2,3]$

Expected Output: True, $[1]$

Input: $A=[5,6,7,8,9],B=[2,3]$

Expected Output: False, $[]$

Input: $A=[1,2,3,2,3,4],B=[2,3]$

Expected Output: True, $[1,3]$

Input: $A=[1,2,3],B=[3,2]$

Expected Output: False, $[]$

Submission

You must solve this problem using Java and use the template provided, SubarrayChecker.java.

You cannot change the method signature for isSubarray otherwise you may receive a score of

$0.$ You are welcome to create additional methods to aid in your implementation.

Following the template description, please:

Write your name and student number at the beginning.

Calculate the time and space complexity of your algorithm and write the result at the end of

your algorithm.