You must complete the code so that it works as follows:

$1.$Once the user has used the Left Mouse Key to create at least one path from one side of the screen to the other, the user should then be able to Right Click the mouse on a yellow cell on the left most side of the screen.

$2.$The program should then search using the recursive search$()$ function to find a path to the right side of the screen following one of the user$$s created paths.

$3.$Each cell on the path should then be displayed in red.

A found path through the maze may look something like: Map Creation

please fix the following code:

require 'gosu'

module ZOrder

BACKGROUND, MIDDLE, TOP $=*0.\mathrm{.}2$

end

MAP$\_$WIDTH $=200$

MAP$\_$HEIGHT $=200$

CELL$\_$DIM $=20$

class Cell

attr$\_$accessor :north, :south, :east, :west, :vacant, :visited, :on$\_$path

def initialize

@north $=$ nil

@south $=$ nil

@east $=$ nil

@west $=$ nil

@vacant $=$ false

@visited $=$ false

@on$\_$path $=$ false

end

end

class GameWindow $$ Gosu::Window

def initialize

super MAP$\_$WIDTH, MAP$\_$HEIGHT, false

self.caption $=$ "Map Creation"

@path $=$ nil

@start$\_$cells $=[]$

@end$\_$cells $=[]$

x$\_$cell$\_$count $=$ MAP$\_$WIDTH $/$ CELL$\_$DIM

y$\_$cell$\_$count $=$ MAP$\_$HEIGHT $/$ CELL$\_$DIM

@columns $=$ Array.new$($x$\_$cell$\_$count$)\{$ Array.new$($y$\_$cell$\_$count$)\{$ Cell.new $\}\}$

# Set the neighbours of each cell.

# Loop through each column, then each row.

@columns.each$\_$with$\_$index do $|$column$,$ column$\_$index$|$

column.each$\_$with$\_$index do $|$cell$,$ row$\_$index$|$

cell.north $=$ @columns$[$column$\_$index$][$row$\_$index $-1]$ if row$\_$index $>0$

cell.south $=$ @columns$[$column$\_$index$][$row$\_$index $+1]$ if row$\_$index $$ y$\_$cell$\_$count $-1$

cell.east $=$ @columns$[$column$\_$index $+1][$row$\_$index$]$ if column$\_$index $$ x$\_$cell$\_$count $-1$

cell.west $=$ @columns$[$column$\_$index $-1][$row$\_$index$]$ if column$\_$index $>0$

end

end

end

def needs$\_$cursor?

true

end

def mouse$\_$over$\_$cell$($mouse$\_$x$,$ mouse$\_$y$)$

cell$\_$x $=$ mouse$\_$x $/$ CELL$\_$DIM

cell$\_$y $=$ mouse$\_$y $/$ CELL$\_$DIM

$[$cell$\_$x$,$ cell$\_$y$]$

end

def button$\_$down$($id$)$

if id $==$ Gosu::MsLeft

# Get the cell the mouse is over.

cell$\_$x$,$ cell$\_$y $=$ mouse$\_$over$\_$cell$($mouse$\_$x$,$ mouse$\_$y$)$

cell $=$ @columns$[$cell$\_$x$][$cell$\_$y$]$

# Toggle the cell's vacancy.

cell.vacant $=!$cell.vacant

elsif id $==$ Gosu::MsRight && $!$@start$\_$cells.empty?

# Get the cell the mouse is over.

cell$\_$x$,$ cell$\_$y $=$ mouse$\_$over$\_$cell$($mouse$\_$x$,$ mouse$\_$y$)$

cell $=$ @columns$[$cell$\_$x$][$cell$\_$y$]$

# Find a path from any of the start cells to this cell.

path$\_$found $=$ false

@start$\_$cells.each do $|$start$\_$cell$|$

if search$0($start$\_$cell, cell$)$

path$\_$found $=$ true

break

end

end

# Color the cells in the path red.

if path$\_$found

cell $=$ @path.east

while cell $!=$ @path

cell.on$\_$path $=$ true

cell $=$ cell.west

end

cell.on$\_$path $=$ true

end

end

end

# A modified DFS algorithm that searches for a path from the start cell to

# the end cell, returning true if one is found, false otherwise.

def search$0($start$\_$cell, destination$)$

# Your search algorithm implementation here

end

end

# Create an instance of the GameWindow class and run the game loop

window $=$ GameWindow.new

window.show