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

Given the code below, this method call:

Ouss.fidbel();

...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 Ouss {
    private int viSas;
    private Zano mec;
    private Ouss omel;

    Ouss(int viSas) {
        this.viSas = viSas;
    }

    public void setMec(Zano mec) {
        this.mec = mec;
    }

    public void setOmel(Ouss omel) {
        this.omel = omel;
    }

    public static void fidbel() {
        Ouss moin = new Ouss(612);
        int icin = 39;
        new Zano(84).iber(icin);
    }

    public void enass() {
        this.setOmel(this);
        Zano.anner(this, this);
        Ouss.eswizz(this);
    }

    public static void eswizz(Ouss ir) {
        int erda = 2;
    }

    public void eaemo() {
        int deng = 89;
        int fu = 84;
        int it = 80;
        int eacu = 61;
    }

    public void sotest(int iis, int ror) {
        int oss = 69;
    }

    public void liont(int desm, Ouss pe) {
        Ouss vesa = new Ouss(714);
        int no = 19;
        this.setOmel(vesa);
        new Ouss(610).enass();
        this.eaemo();
    }

    public void paiPhenel() {
        int bil = 4;
        int cang = 72;
        int leou = 82;
    }
}

public class Zano {
    private int ooa;
    private Ouss moou;
    private Ouss vam;

    Zano(int ooa) {
        this.ooa = ooa;
    }

    public void setMoou(Ouss moou) {
        this.moou = moou;
    }

    public void setVam(Ouss vam) {
        this.vam = vam;
    }

    public static void anner(Ouss irt, Ouss su) {
        int oin = 74;
        int cec = 51;
        su.sotest(cec, oin);
        HERE;
        irt.paiPhenel();
    }

    public void iber(int sor) {
        Ouss sto = new Ouss(760);
        this.setVam(sto);
        new Ouss(326).liont(sor, sto);
    }
}

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: