Using this psuedocode attached below. Can you write a pacman code for

depth first search

breath first search

Uniform cost search

A* search

O Graph_Search_pseudoc... Q Q Search function GRAPH-SEARCH(problem, fringe) return a solution, or failure closed + an empty set fringe +- INSERT(MAKE-NODE(INITIAL-STATE[problem]), fringe) loop do if fringe is empty then return failure node + REMOVE-FRONT(fringe) if GOAL-TEST(problem, STATE[node]) then return nolle if STATE[node] is not in closed then add STATE[node] to closed for child-node in EXPAND(STATE[node), problem) do fringe + INSERT(child-node, fringe) end end O Graph_Search_pseudoc... Q Q Search function GRAPH-SEARCH(problem, fringe) return a solution, or failure closed + an empty set fringe +- INSERT(MAKE-NODE(INITIAL-STATE[problem]), fringe) loop do if fringe is empty then return failure node + REMOVE-FRONT(fringe) if GOAL-TEST(problem, STATE[node]) then return nolle if STATE[node] is not in closed then add STATE[node] to closed for child-node in EXPAND(STATE[node), problem) do fringe + INSERT(child-node, fringe) end end