Stack frames and objects (like the Idea Lab activity): Correct Solution

Given the code below, this method call:

Nes.cioOcror();

...will eventually reach the point marked HERE. Draw a diagram of the stack and the heap at that point.

(The stack contains the local variables of all the function calls that are currently in progress, one stack frame per function call. The heap contains all of the objects that currently exist.)

In your diagram:

Label each stack frame with the name of the method.
Label each object with the name of its class.
Include the names of all the variables that belong to each object and stack frame, including the implicit this parameter if present. (You do not need to write the types of any variables.)
When a variable's value is null or a primitive, write the value immediately next to the variable.
When a variable points to an object, draw an arrow from the variable to the object it points to.

The code:

public class Nes {
    private int iin;
    private Nes ge;

    Nes(int iin) {
        this.iin = iin;
    }

    public void setGe(Nes ge) {
        this.ge = ge;
    }

    public static void cioOcror() {
        Ciint peet = new Ciint(967);
        new Ciint(667).micgro();
        peet.setZe(peet);
        new Nes(169).pedsoc(peet, 78);
    }

    public void pedsoc(Ciint in, int bil) {
        new Ciint(186).eclut();
        in.setZe(in);
        Ciint.mehGnung(new Ciint(225));
    }
}

public class Ciint {
    private int jugu;
    private Ciint ze;

    Ciint(int jugu) {
        this.jugu = jugu;
    }

    public void setZe(Ciint ze) {
        this.ze = ze;
    }

    public static void mehGnung(Ciint tros) {
        int prap = 1;
        HERE;
    }

    public void eclut() {
        Ciint pa = new Ciint(303);
        int lu = 29;
    }

    public void micgro() {
        int so = 88;
    }
}

Solution

Hints for practicing this puzzle:

Practice with difficulty 0, then work your way up. This will help you get a handle on what the puzzle is asking.
There is only one path through the code from the starting method call to HERE. Start by finding that path.
Be thorough. Double check that you've fully diagrammed each step before you move on to the next one.
You can feed this code into https://pythontutor.com and watch a diagram like this build up step by step. (Yes, despite the web site's name, it also works with Java.)

Related puzzles: