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

Given the code below, this method call:

Heene.diacfi();

...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 Heene {
    private int busom;
    private Spoel le;
    private Spoel me;

    Heene(int busom) {
        this.busom = busom;
    }

    public void setLe(Spoel le) {
        this.le = le;
    }

    public void setMe(Spoel me) {
        this.me = me;
    }

    public void sedhia() {
        Heene mi = new Heene(102);
        int pric = 40;
        int ac = 15;
        this.wess(pric, 74, mi);
        Spoel.osuss(ac, mi, pric);
        Spoel.risli(mi, pric, ac);
    }

    public static void diacfi() {
        Heene rhed = new Heene(949);
        new Heene(457).uannes(rhed, new Spoel(141));
    }

    public void uannes(Heene pu, Spoel soi) {
        Heene eca = new Heene(761);
        Spoel.gleAhank(soi, new Heene(237), this);
        eca.setMe(soi);
        eca.sedhia();
    }

    public void wess(int wic, int qi, Heene pso) {
    }
}

public class Spoel {
    private int psess;
    private Spoel cel;

    Spoel(int psess) {
        this.psess = psess;
    }

    public void setCel(Spoel cel) {
        this.cel = cel;
    }

    public static void risli(Heene ro, int ir, int iom) {
        int scru = 28;
    }

    public static void gleAhank(Spoel vess, Heene naki, Heene niae) {
    }

    public static void osuss(int piil, Heene ces, int o) {
        HERE;
    }
}

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: