Exercise 2: Why the Breadcrumb Loop Is a Real (But Acceptable) N+1 — Possible Solution
====================================================================

WHY IT'S A GENUINE N+1 PATTERN
------------------------------
Per this chapter, the breadcrumb loop's node = node.parent line triggers a separate, fresh database query every time it accesses a parent that hasn't already been loaded. Building a breadcrumb for a page five levels deep means walking node.parent up to five separate times, each one a distinct round trip to the database - a textbook N+1 pattern, where N extra queries happen instead of the ideal of one.

WHY THIS CHAPTER TREATS IT AS ACCEPTABLE RIGHT NOW
------------------------------
Per this chapter, the key detail is that breadcrumb depth is BOUNDED - this site never goes deeper than a handful of levels, so the "N" in this particular N+1 is always small (at most five or so), not unbounded. Five small queries per page view is a real but genuinely minor cost, not the kind of problem that demands an immediate fix. This chapter contrasts it directly against the same pattern applied to something unbounded - a page listing with many rows, each needing its own parent's title - where an unknown, potentially large N turns the identical pattern into a real, serious performance problem.

WHY THIS WORKS AS AN ANSWER
------------------------------
It correctly explains why the breadcrumb loop is genuinely N+1 (each .parent access not already loaded is a separate query), and correctly explains why this chapter still calls it acceptable for now - because the breadcrumb's own N is small and bounded, unlike an unbounded listing where the same pattern would be a real problem.