please help me to implement the method

public class BottomUpDynamicProgramming { TODO * Returns an array consisting of the longest increasing subsequence *in a. Your solution must follow the code sketch given in lecture. public static intl lis(int[l a) f int n- a.length; Result[] cache = new Result [n]; return null; TODO: Write a comprehensive battery of test cases public static void main(String... args) f int[] a, b; a- new intl] T 5, 6, 1, 2, 9, 3, 4, 7, 4, 3 J; b = lis(a); assert 5 b.length; assert 1b[0]; assert 2b[1]; assert 3b[2]; assert 4 bl 31; assert 7b[4]; a=new int[] { 2, 1, 5, 3, 6, 4, 2, 7, 9, 11, 8, 10 ); b-Lis(a) assert 6 == b.length; assert 2 =-b[0]; assert 5b[1]; assert 6 == b[2]; assert 7-b[3 assert b[41