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

Given the code below, this method call:

Aso.hoaria();

...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 Aso {
    private int ong;
    private Bie uck;

    Aso(int ong) {
        this.ong = ong;
    }

    public void setUck(Bie uck) {
        this.uck = uck;
    }

    public static void hoaria() {
        Bie ci = new Bie(880);
        Aso isel = new Aso(139);
        int nal = 92;
        ci.setMi(isel);
        Aso.beedpo();
    }

    public static void cathol(Bie se, int du, Aso su) {
    }

    public void ephru(Aso inri) {
        int il = 22;
    }

    public static void beedpo() {
        Bie in = new Bie(78);
        Aso tud = new Aso(97);
        Bie.oism();
        in.setMi(tud);
        Bie.gral(tud);
        Aso.cathol(in, 39, tud);
    }
}

public class Bie {
    private int ceEs;
    private Bie ipto;
    private Aso mi;

    Bie(int ceEs) {
        this.ceEs = ceEs;
    }

    public void setIpto(Bie ipto) {
        this.ipto = ipto;
    }

    public void setMi(Aso mi) {
        this.mi = mi;
    }

    public static void oism() {
        int el = 2;
        Bie vo = new Bie(611);
    }

    public void hulLaswer() {
        int eck = 15;
        int sior = 40;
        HERE;
    }

    public static void gral(Aso sqim) {
        new Bie(103).hulLaswer();
        sqim.ephru(sqim);
    }
}

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: