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

Given the code below, this method call:

Aom.papra();

...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 Aom {
    private int hec;
    private Aom lo;

    Aom(int hec) {
        this.hec = hec;
    }

    public void setLo(Aom lo) {
        this.lo = lo;
    }

    public void fomPessil(Aom hisi) {
    }

    public void nulde(Anfi ceng) {
        int spir = 59;
    }

    public static void papra() {
        Aom.afaPremo(new Anfi(548), 86, new Anfi(421));
    }

    public static void afaPremo(Anfi ivi, int ro, Anfi edi) {
        new Aom(330).nulde(ivi);
        new Aom(877).priaen(ro);
    }

    public void priaen(int du) {
        Anfi iss = new Anfi(657);
        new Aom(44).fomPessil(this);
        iss.setAe(iss);
        iss.tozun();
    }
}

public class Anfi {
    private int ciced;
    private Anfi nool;
    private Anfi ae;
    private Aom pe;

    Anfi(int ciced) {
        this.ciced = ciced;
    }

    public void setNool(Anfi nool) {
        this.nool = nool;
    }

    public void setAe(Anfi ae) {
        this.ae = ae;
    }

    public void setPe(Aom pe) {
        this.pe = pe;
    }

    public void zuto(int miam, int ap, Anfi bil) {
    }

    public void tozun() {
        int se = 0;
        int spua = 92;
        Anfi gi = new Anfi(285);
        new Anfi(750).uder(gi);
        this.setAe(gi);
        this.siead(spua);
    }

    public void siead(int ar) {
        Anfi niis = new Anfi(465);
        int pasm = 57;
        this.zuto(ar, pasm, niis);
        this.setAe(niis);
        HERE;
    }

    public void uder(Anfi prac) {
        Anfi fipo = new Anfi(551);
        Anfi tep = new Anfi(638);
        Aom si = new Aom(629);
    }
}

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: