Please complete the answer and response as soon as possible! thanks! JAVA

The following code is given Polic class MemoryModel { public static void main(String[] args) { double[] array - {0.5, 0.25); double x; methi(array); X = meth2Carray.Length 1, array): System.out.println(x): public static void methi(double[] a){ for(int i = a. length - 1; i >= 0; i--){ a[i] - 2.0; } public static double meth2(int k, double[] a){ if Ck -- 0) { return a[k]; } else { return 2.0 meth2Ck - 1, a); 1 } Your jcb a ta show how memory would lock like when this code is executed. Far this, you need to fill in the tables below, which represent the program stack and the garbage collectible heap. The first celum shows the memory address and the second shows the content of the memory For this question, we have a couple of assumptions: Assume that the stack frames are never released, when a method terminates ita recution. - nu space is served for the return value of the method - A memory address ile object reference) requires 4 bytes of data. assume that the local variables of the recursive method is the only data that a stored in the memory li .. we are not interested to stare program line number in the stack). - the printin method requires no space in memory Program Stack Memory Address Memory content Garbage Collectible Head Memory Content Memory Address con The following code is given Polic class MemoryModel { public static void main(String[] args) { double[] array - {0.5, 0.25); double x; methi(array); X = meth2Carray.Length 1, array): System.out.println(x): public static void methi(double[] a){ for(int i = a. length - 1; i >= 0; i--){ a[i] - 2.0; } public static double meth2(int k, double[] a){ if Ck -- 0) { return a[k]; } else { return 2.0 meth2Ck - 1, a); 1 } Your jcb a ta show how memory would lock like when this code is executed. Far this, you need to fill in the tables below, which represent the program stack and the garbage collectible heap. The first celum shows the memory address and the second shows the content of the memory For this question, we have a couple of assumptions: Assume that the stack frames are never released, when a method terminates ita recution. - nu space is served for the return value of the method - A memory address ile object reference) requires 4 bytes of data. assume that the local variables of the recursive method is the only data that a stored in the memory li .. we are not interested to stare program line number in the stack). - the printin method requires no space in memory Program Stack Memory Address Memory content Garbage Collectible Head Memory Content Memory Address con