Briefly explain (in words) what is being done by the following code. 

Please Draw the memory layout of all the process and threads created by the following program when the stack is at maximum size. Explicitly show all the memory regions

 

Transcribed Image Text:

public class T1 { int[] numbers = new int[40000]; an array of 40000 integers filled with random values public void process() { Thread t1 = new Thread(new MinFinder(0, 20000)); Thread t2 = new Thread(new MinFinder (20000,40000)); t1.start(); t2.start(); } try { } t1.join(); t2.join(); } catch (Interrupted Exception e) { ie.printStackTrace(); if (t1.min<t2.min) print(t1.min) else print(t2.min) public static void main(String[] args) { T1 t1 = new T1(); T1.process() public class T1 { int[] numbers = new int[40000]; an array of 40000 integers filled with random values public void process() { Thread t1 = new Thread(new MinFinder(0, 20000)); Thread t2 = new Thread(new MinFinder (20000,40000)); t1.start(); t2.start(); } try { } t1.join(); t2.join(); } catch (Interrupted Exception e) { ie.printStackTrace(); if (t1.min<t2.min) print(t1.min) else print(t2.min) public static void main(String[] args) { T1 t1 = new T1(); T1.process()