= Solution
In <Scala trait linearization>, the rightmost mixed-in <trait> takes priority. Merge inherited linearizations while retaining a shared ancestor only at its final position; `super` advances to the next implementation in the resulting chain. Ignoring predefined bases, the lookup orders are
``
Life1, Exercise, Work, Life
Life2, Dance, Exercise, Program, Study, Work, Fun, Life
Life3, Program, Study, Work, Dance, Fun, Exercise, Life
``
For example, `Dance` alone has order `Dance, Fun, Exercise, Life`. In `Life2`, the additional `Program` branch already contains `Fun` before `Life`; keeping that shared ancestry in its later position moves `Fun` after `Work`, while `Dance` still takes priority. Reversing the mixins yields the third chain above.
Each `describe` first delegates and then prints, so the lines appear in the reverse of the method lookup order. The exact output, including the two blank lines, is
``
I live.
I work.
I exercise.
I live.
I have fun.
I work.
I study.
I program.
I exercise.
I dance.
I live.
I exercise.
I have fun.
I dance.
I work.
I study.
I program.
``
$$
\boxed{\text{Lookup follows the linearization; these prints occur while the calls return}.}
$$
The `super` inside a <trait> therefore need not call that <trait>'s isolated textual parent; the receiving object's full <Scala trait linearization> controls the next body.
Back to article page
