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

Given the code below, this method call:

Cesso.ilunt();

...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 Cesso {
    private int pruss;
    private Bron otoo;
    private Bron stro;

    Cesso(int pruss) {
        this.pruss = pruss;
    }

    public void setOtoo(Bron otoo) {
        this.otoo = otoo;
    }

    public void setStro(Bron stro) {
        this.stro = stro;
    }

    public static void ungo(Bron isse) {
        Bron zom = new Bron(258);
    }

    public static void soldoc(int maso, int sesm) {
        int ou = 32;
        int ru = 42;
        int kes = 1;
    }

    public void hoiplo(Bron uma, int buca) {
        int ui = 51;
        new Bron(857).priosm();
        this.setOtoo(uma);
        new Bron(477).strer();
    }

    public static void ilunt() {
        int iac = 4;
        Bron bic = new Bron(385);
        bic.laeAont(bic);
        bic.setEsti(bic);
        Cesso.wicDesa(new Cesso(584), iac);
    }

    public static void wicDesa(Cesso proh, int rard) {
        Bron wam = new Bron(735);
        proh.setOtoo(wam);
        new Cesso(482).hoiplo(wam, rard);
    }

    public static void uent() {
        Cesso og = new Cesso(258);
        int eid = 27;
        int uss = 61;
        int ge = 11;
        HERE;
        Cesso.soldoc(ge, uss);
    }
}

public class Bron {
    private int feron;
    private Cesso ang;
    private Bron esti;

    Bron(int feron) {
        this.feron = feron;
    }

    public void setAng(Cesso ang) {
        this.ang = ang;
    }

    public void setEsti(Bron esti) {
        this.esti = esti;
    }

    public void priosm() {
        Cesso oji = new Cesso(566);
    }

    public void strer() {
        int piud = 33;
        Cesso.uent();
        Bron.hamis(this);
    }

    public static void hamis(Bron ias) {
        int tru = 62;
        int fonk = 75;
        int kani = 31;
    }

    public void laeAont(Bron lued) {
        int sa = 44;
        Cesso.ungo(this);
    }
}

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: