Consider a single player video game with the following properties. The world is represented by a 25x25 two-dimensional grid. In addition to the player, there are non-playable characters (NPCs) that move randomly (these are not other agents, however) as well as unmovable walls. The player has a candle which illuminates all cells that are less than 3 steps away. All other cells are black, even the occupied ones. The game proceeds in steps, and in each step the player can choose to move to an adjacent unoccupied cell or else attack an adjacent cell. Attacking freezes an NPC for a few steps (the exact number is randomly chosen). In a step, the other characters move, too, but only after the agents move has been computed. The next state of the system is obtained by performing the chosen moves in order. The player has a health value (starting at 10 and lessened by 1 each time the agent is attacked by an adjacent NPC). The object of the game is to survive as many steps as possible. From the following list, select the largest subset that you think adequately describes the games task environment. Justify your choices. Fully observable, partially observable, single agent, multiagent, deterministic, stochastic, episodic, sequential, static, dynamic, discrete, continuous, known, unknown.