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

Given the code below, this method call:

Hoir.flusm();

...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 Hoir {
    private int gaIod;
    private Ede da;
    private Ede vi;

    Hoir(int gaIod) {
        this.gaIod = gaIod;
    }

    public void setDa(Ede da) {
        this.da = da;
    }

    public void setVi(Ede vi) {
        this.vi = vi;
    }

    public static void crac(int hi, int de, Ede joc) {
        int ed = 86;
        int hism = 8;
    }

    public static void mait() {
        Ede sper = new Ede(669);
        int ulme = 14;
        Ede iol = new Ede(526);
        sper.setHo(iol);
        iol.kimhi(ulme);
    }

    public static void flusm() {
        Hoir ti = new Hoir(923);
        int pec = 87;
        Ede.nague();
    }

    public void orpons() {
        int sqe = 16;
        int re = 81;
        int isme = 65;
    }
}

public class Ede {
    private int resod;
    private Ede ho;
    private Hoir al;

    Ede(int resod) {
        this.resod = resod;
    }

    public void setHo(Ede ho) {
        this.ho = ho;
    }

    public void setAl(Hoir al) {
        this.al = al;
    }

    public void kimhi(int an) {
        Ede ba = new Ede(548);
        ba.setHo(this);
        new Ede(580).pritwe(new Hoir(752), this, an);
        ba.dingce(ba, this, an);
    }

    public static void nague() {
        Ede.peca(new Ede(290), new Hoir(374), new Ede(755));
        Hoir.mait();
    }

    public void pritwe(Hoir il, Ede io, int pi) {
        int nu = 20;
        Hoir.crac(pi, nu, io);
        il.setVi(io);
        HERE;
        il.orpons();
    }

    public void dingce(Ede miap, Ede li, int rir) {
        int o = 94;
    }

    public static void peca(Ede va, Hoir ee, Ede prol) {
    }
}

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: