Design a navigation and mapping system for a classroom robot to explore an unknown maze with limited memory. Specify (a) an exploration algorithm suitable for constrained memory (how it ensures full coverage and avoids getting stuck), (b) compact map data structures and memory-management or forgetting strategies, (c) required sensors and how sensor data is used, and (d) a method to compute and follow the shortest return path to the start. Provide high-level pseudocode or a simple diagram, justify key trade-offs, and describe why your choices are appropriate for a Grade 6–8 classroom project emphasizing creative problem solving.