Define a Python function maze_solver(maze, start, goal) to figure out if a path exists within 'maze' from 'start' to 'goal'. This must be a recursive function.

-- The maze must be represented as a list of lists, with the start and goal locations represented as tuples (x, y) where 'x' and 'y' represent the index values of the list of lists that represents the maze.

-- Input to the function will be a file of text where '0' represents an open block and '1' represents a closed block.

-- The output must incude the maze wthe the path if the path exists; marked with a 'P'. It must also return True if the path exists, False otherwise.

-- An example maze is as follows:

1 1 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0

Start (0, 3)

Goal (4, 5)