Please can you create a python code to solve a pacman game using the

depth for search

breath for search

Uniform cost search

A*search.

Please will you be able to do this?

You are to use this pseudocode attached below as guide

Graph_Search_pseudoc... 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