Programming Language: Python, Complier to be Used: Juptyer Notebook

TASKS T#01 Consider an Interactive Cognitive Environment (ICE) in which autonomous robot is performing cleaning task in the big room that appears to be a matrix of NM. Each index referred to as a cell of the matrix is valued as dirty "D" or clean "C". The cells which are occupied by the stuff in the room are blocked and valued "B". The vacuum can move in all four directions (up, down, left, right), and if the cell status is D, it will clean the cell and change the status to "C", if the cell status is either C, it will not enter the cell. The vacuum will stop working if the whole room is cleaned i.e., the status of all the cells is either C. The vacuum may start cleaning the room from the first cell (0, 0) or any random location. You will trace the path of the vacuum and display at each step of the program. * Represent the location of the vacuum cleaner. Develop a Python code of the above describe scenario of the autonomous robot. D D D C CC c. C C C A DO D U D D D D D D Ce D D D D D OOOOO D D D D D D D D D D D D D ID D If vacuum is in a location where it's all neighbors (up, down, left and right) are clean (with status C) it will move in any one of the directions and keep searching the Dirt (D). It will stop it execution if it does not sense any dirt after 10 movements. If vacuum is in a location where it's one more neighbor (up down, left and right) is dirty it will move in any one of the directions and will return to the location when it cleans all the dirty cell of its neighbors.e.g. cell (0, 3) where it's three neighbors are dirty