Please help me with this problem. Thank you.

Testing Your MaxSubFinder I have given you a very limited set of JUnit tests to help determine if your implementation is correct. You need to add at least 5 more JUnit tests for the getMaxSubArray method and the getMaxSubList method that test both typical and edge cases. You are welcome to create more than five JUnit tests, but as long as you create and pass five JUnit tests.

package divideandconquer; import divideandconquer.LinkedList.Node;

import static org.junit.Assert.*;

import org.junit.Before; import org.junit.BeforeClass; import org.junit.Test;

public class MaxSubFinderTest {

@BeforeClass public static void setUpBeforeClass() throws Exception { }

@Before public void setUp() throws Exception { }

@Test public void givenArrayTest() { int[] intArray = new int[]{13,-3,-25,-20,-3,-16,-23,18, 20,-7,12,-5,-22,15,-4,7}; Triple res = MaxSubFinder.getMaxSubarray(intArray); Integer expectedSum = 43; assertEquals(expectedSum,res.getLast()); } @Test public void givenLinkedTest() { int[] intArray = new int[]{13,-3,-25,-20,-3,-16,-23,18, 20,-7,12,-5,-22,15,-4,7}; LinkedList list = new LinkedList(intArray); Triple res = MaxSubFinder.getMaxSubList(list); Integer expectedSum = 43; assertEquals(expectedSum,res.getLast()); }

}