Option A — Optimization (20): Given 200 draggable elements behaving like slime, describe an optimized update loop and collision strategy that minimizes CPU and memory churn. Include pseudo-code for the main loop and explain use of spatial partitioning or level-of-detail.