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

Given the code below, this method call:

Qig.weus();

...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 Qig {
    private int cufer;
    private Sied gemn;
    private Sied fia;

    Qig(int cufer) {
        this.cufer = cufer;
    }

    public void setGemn(Sied gemn) {
        this.gemn = gemn;
    }

    public void setFia(Sied fia) {
        this.fia = fia;
    }

    public void ragre() {
        int ptou = 61;
        int waat = 31;
        Sied.coass(this);
        Sied.ocru(this);
    }

    public static void esaXen(int ep) {
        int nen = 34;
        int pidu = 51;
        int jacs = 75;
        int ount = 29;
    }

    public static void weus() {
        Qig cle = new Qig(224);
        new Qig(819).ragre();
    }
}

public class Sied {
    private int chel;
    private Qig ud;
    private Sied hus;

    Sied(int chel) {
        this.chel = chel;
    }

    public void setUd(Qig ud) {
        this.ud = ud;
    }

    public void setHus(Sied hus) {
        this.hus = hus;
    }

    public void blaTreng() {
        int neoc = 77;
        int pren = 56;
    }

    public void ebess() {
        int feph = 92;
        Sied dioi = new Sied(811);
        this.blaTreng();
        this.setHus(dioi);
        dioi.osmrhe();
    }

    public void chul(Sied beu, int at) {
    }

    public static void ocru(Qig ahan) {
        int osas = 95;
        int cac = 53;
        int anle = 25;
    }

    public static void coass(Qig idu) {
        int rass = 45;
        Sied suoe = new Sied(837);
        Qig mie = new Qig(904);
        suoe.chul(new Sied(860), 3);
        mie.setGemn(suoe);
        new Sied(283).ebess();
    }

    public void osmrhe() {
        int nido = 70;
        int sost = 97;
        int jeng = 75;
        HERE;
        Qig.esaXen(sost);
    }
}

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: