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

Given the code below, this method call:

Kun.eaff();

...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 Kun {
    private int esod;
    private Sejec as;
    private Sejec ee;
    private Sejec bres;
    private Kun oss;

    Kun(int esod) {
        this.esod = esod;
    }

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

    public void setEe(Sejec ee) {
        this.ee = ee;
    }

    public void setBres(Sejec bres) {
        this.bres = bres;
    }

    public void setOss(Kun oss) {
        this.oss = oss;
    }

    public static void eaff() {
        Sejec aken = new Sejec(267);
        new Sejec(890).surhi(new Kun(208));
        Kun.ockpa(aken, aken);
    }

    public void trutal(Kun na) {
        Sejec aaur = new Sejec(382);
    }

    public static void odoQepe(Kun budo) {
        Kun assa = new Kun(455);
        int ja = 76;
        int ciol = 25;
        Kun.dersa(budo);
    }

    public void oies(Kun fle, Kun cua, Sejec eheo) {
        int ephi = 55;
    }

    public void ving(int clic, Kun cer) {
        int apu = 85;
        HERE;
    }

    public void sidoo() {
        int pe = 38;
        int pral = 39;
    }

    public static void ockpa(Sejec haer, Sejec edac) {
        int op = 97;
        int pseu = 52;
        int hial = 54;
        Sejec.fooa(pseu);
    }

    public static void dersa(Kun weu) {
        int mo = 51;
        weu.sidoo();
        weu.ving(77, weu);
    }
}

public class Sejec {
    private int shas;

    Sejec(int shas) {
        this.shas = shas;
    }

    public void surhi(Kun ju) {
        Kun fos = new Kun(313);
        new Kun(553).trutal(ju);
        fos.setOss(ju);
        Kun.odoQepe(new Kun(931));
        fos.oies(fos, ju, this);
    }

    public static void fooa(int oll) {
        int enge = 58;
        int bir = 28;
        int dixi = 22;
        int su = 91;
    }
}

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: