Java help

1. Draw the memory map of the following one-dimensional ragged array of type String.

String[] z = new String[4];

for (int i = 0; i < z.length; i++) {

z[i] = "element " + i;

}

Stack:

Heap:

2. a. Write the shallow copy of the following. String[] progLang = {"Algol", "Cobol", "Python", "Java", "Prolog"};

String [] progLang = new String [progLand.length];

for (int i = 0; i < progLang.length; i++) {

progLang[i] = puppies[i];

}

return copy;

} }

b. Draw the memory map.

Stack:

Heap: