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

Given the code below, this method call:

Dirch.scen();

...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 Dirch {
    private int erism;
    private Espa qa;

    Dirch(int erism) {
        this.erism = erism;
    }

    public void setQa(Espa qa) {
        this.qa = qa;
    }

    public static void wemed() {
        int ige = 36;
    }

    public void socin() {
        int nes = 20;
        int ai = 78;
        int ot = 79;
        this.dinir(this);
        Dirch.aecPutre(ai, ot);
    }

    public static void aecPutre(int ri, int crar) {
        Espa.sove(ri);
        Dirch.wemed();
    }

    public void dinir(Dirch ited) {
    }

    public static void scen() {
        Dirch enan = new Dirch(769);
        Espa lo = new Espa(48);
        Espa anu = new Espa(41);
        Dirch jadi = new Dirch(713);
        anu.setJi(lo);
        enan.socin();
    }
}

public class Espa {
    private int upte;
    private Dirch as;
    private Espa ji;

    Espa(int upte) {
        this.upte = upte;
    }

    public void setAs(Dirch as) {
        this.as = as;
    }

    public void setJi(Espa ji) {
        this.ji = ji;
    }

    public static void sove(int edot) {
        Dirch rhac = new Dirch(474);
        int prer = 42;
        Espa.fliia(prer, edot);
        HERE;
    }

    public static void fliia(int spi, int co) {
        int smuu = 66;
    }
}

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: