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

Given the code below, this method call:

Bagon.hess();

...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 Bagon {
    private int deasm;
    private Bagon api;

    Bagon(int deasm) {
        this.deasm = deasm;
    }

    public void setApi(Bagon api) {
        this.api = api;
    }

    public static void clid(Qer iing) {
        int fril = 87;
        HERE;
        Bagon.rohess(fril);
    }

    public void clasum(int tru) {
        Bagon icle = new Bagon(489);
        int esba = 80;
    }

    public static void rohess(int eca) {
    }

    public static void ooro(int bia, Qer swes, Qer anch) {
        Qer ien = new Qer(902);
        Qer us = new Qer(488);
        new Bagon(174).psinpe(new Bagon(296));
    }

    public void psinpe(Bagon te) {
        int hiri = 65;
        int ri = 90;
        Bagon meir = new Bagon(616);
    }

    public void tadol(int co, int ceoi) {
        this.setApi(this);
        Qer.ormChri(this);
    }

    public static void hess() {
        Qer noz = new Qer(855);
        int trea = 37;
        Bagon.ooro(trea, new Qer(293), noz);
        noz.setBaik(noz);
        noz.irflen(33, new Bagon(979), trea);
    }
}

public class Qer {
    private int etris;
    private Bagon spio;
    private Qer baik;
    private Qer anpi;

    Qer(int etris) {
        this.etris = etris;
    }

    public void setSpio(Bagon spio) {
        this.spio = spio;
    }

    public void setBaik(Qer baik) {
        this.baik = baik;
    }

    public void setAnpi(Qer anpi) {
        this.anpi = anpi;
    }

    public void osci(Bagon cu) {
        int veid = 14;
    }

    public static void ormChri(Bagon di) {
        Qer ad = new Qer(970);
        int siwa = 72;
        Bagon reci = new Bagon(490);
        Bagon.clid(ad);
    }

    public void irflen(int arve, Bagon ir, int thia) {
        Bagon na = new Bagon(61);
        na.clasum(thia);
        ir.setApi(na);
        new Bagon(389).tadol(arve, thia);
        this.osci(ir);
    }
}

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: