Show me the steps to solve $1.$ Create a recursive, multithreaded program that finds the exit of each maze.

import math

import threading

from screen import Screen

from maze import Maze

import sys

import cv$2$

SCREEN$\_$SIZE $=800$

COLOR $=(0,0,255)$

COLORS $=($

$(0,0,255),$

$(0,255,0),$

$(255,0,0),$

$(255,255,0),$

$(0,255,255),$

$(255,0,255),$

$(128,0,0),$

$(128,128,0),$

$(0,128,0),$

$(128,0,128),$

$(0,128,128),$

$(0,0,128),$

$(72,61,139),$

$(143,143,188),$

$(226,138,43),$

$(128,114,250)$

$)$

# Globals

current$\_$color$\_$index $=0$

thread$\_$count $=0$

stop $=$ False

def get$\_$color$()$:

$"""$ Returns a different color when called $"""$

global current$\_$color$\_$index

if current$\_$color$\_$index $>=$ len$($COLORS$)$:

current$\_$color$\_$index $=0$

color $=$ COLORS$[$current$\_$color$\_$index$]$

current$\_$color$\_$index $+=1$

return color

def solve$\_$find$\_$end$($maze$)$:

$"""$ finds the end position using threads. Nothing is returned $"""$

# When one of the threads finds the end position, stop all of them

# TODO $-$ add code here

pass

def find$\_$end$($filename$,$ delay$)$:

global thread$\_$count

# create a Screen Object that will contain all of the drawing commands

screen $=$ Screen$($SCREEN$\_$SIZE, SCREEN$\_$SIZE$)$

screen.background$((255,255,0))$

maze $=$ Maze$($screen$,$ SCREEN$\_$SIZE, SCREEN$\_$SIZE, filename, delay$=$delay$)$

solve$\_$find$\_$end$($maze$)$

print$($f$\text{'}$Number of drawing commands $=\{$screen$.$get$\_$command$\_$count$()\}\text{'})$

print$($f$\text{'}$Number of threads created $=\{$thread$\_$count$\}\text{'})$

done $=$ False

speed $=1$

while not done:

if screen.play$\_$commands$($speed$)$:

key $=$ cv$2.$waitKey$(0)$

if key $==$ ord$(\text{'}+\text{'})$:

speed $=$ max$(0,$ speed $-1)$

elif key $==$ ord$(\text{'}-\text{'})$:

speed $+=1$

elif key $!=$ ord$(\text{'}$p$\text{'})$:

done $=$ True

else:

done $=$ True

def find$\_$ends$()$:

files $=($

$(\text{'}$verysmall$.$bmp$\text{'},$ True$),$

$(\text{'}$verysmall$-$loops.bmp$\text{'},$ True$),$

$(\text{'}$small$.$bmp$\text{'},$ True$),$

$(\text{'}$small$-$loops.bmp$\text{'},$ True$),$

$(\text{'}$small$-$odd.bmp$\text{'},$ True$),$

$(\text{'}$small$-$open.bmp$\text{'},$ False$),$

$(\text{'}$large$.$bmp$\text{'},$ False$),$

$(\text{'}$large$-$loops.bmp$\text{'},$ False$)$

$)$

print$(\text{'}*\text{'}*40)$

print$(\text{'}$Part $2\text{'})$

for filename, delay in files:

print$()$

print$($f$\text{'}$File: $\{$filename$\}\text{'})$

find$\_$end$($filename$,$ delay$)$

print$(\text{'}*\text{'}*40)$

def main$()$:

# prevent crashing in case of infinite recursion

sys$.$setrecursionlimit$(5000)$

find$\_$ends$()$

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

main$()$

using this for its thread

if maze.at$\_$end$($x$,$ y$)$:

solution$\_$path.append$(($x$,$ y$))$

return True

if not maze.can$\_$move$\_$here$($x$,$ y$)$:

return False

maze.move$($x$,$ y$,$ COLOR$)$

solution$\_$path.append$(($x$,$ y$))$

for move in maze.get$\_$possible$\_$moves$($x$,$ y$)$:

if solve$($maze$,$ move$[0],$ move$[1],$ solution$\_$path$)$:

return True

solution$\_$path.pop$()$

maze.restore$($x$,$ y$)$

return False

each thread needs to be a different color