This question evaluates a candidate's ability to reason about simulation, state transitions, and geometric invariants when analyzing periodic movement on an infinite grid, testing competencies in algorithmic reasoning, discrete geometry, and finite-state behavior within the Coding & Algorithms domain.
A robot starts at (0, 0) facing North on an infinite grid. It executes a string s consisting of 'G' (move forward 1 unit), 'L' (turn left 90°), and 'R' (turn right 90°) once, then repeats s forever. Return true if the robot stays within a bounded circle; otherwise return false. Justify your reasoning, discuss edge cases, and provide code.