The scene shows a 10x10 grid with a orange start square (containing a red circular agent) and a blue end square. Starting from the orange start square, the agent can move to adjacent cells (up, down, left, right). The goal is to move the agent to the blue end square along the shortest path. Only modify what the task requires; keep the background and any other element unchanged. Output one image showing the complete shortest path drawn as a cyan line, with the agent at the end position.