How do I implement the following pseudocode of breadth-first search with python 3. Thank you!

function breadth first search begin open [Start] closed[ while open [] do % initialize % states remain begin remove leftmost state from open, call it X; if X is a goal then return SUCCESS % goal found else begin generate children of X; put X on closed discard children of X if already on open or closed put remaining children on right end of open % loop check % queue return FAIL end % no states left 1. open [A]; closed[ 2. open = [B,C,D]. closed-A 3. open = [C,D,E,F): closed = [BA] 4. open [D,E,F,G,H; closed [C,B,A] 5. open [E,F,G,H,I,J]; closed [D,C,B,A] open = [F,G, H,I,J,K,L]. closed = [E,D,C,B,A] 7. open = [G,H,l,J,K,L,M] (as L is already on open); closed = [F,E,D,C,B,A] 8. open [H,I,J,K,L,M,N]; closed- [G,F,E,D,C,B,A] 9. and so on until either U is found or open [. Assuming the graph is search space function breadth first search begin open [Start] closed[ while open [] do % initialize % states remain begin remove leftmost state from open, call it X; if X is a goal then return SUCCESS % goal found else begin generate children of X; put X on closed discard children of X if already on open or closed put remaining children on right end of open % loop check % queue return FAIL end % no states left 1. open [A]; closed[ 2. open = [B,C,D]. closed-A 3. open = [C,D,E,F): closed = [BA] 4. open [D,E,F,G,H; closed [C,B,A] 5. open [E,F,G,H,I,J]; closed [D,C,B,A] open = [F,G, H,I,J,K,L]. closed = [E,D,C,B,A] 7. open = [G,H,l,J,K,L,M] (as L is already on open); closed = [F,E,D,C,B,A] 8. open [H,I,J,K,L,M,N]; closed- [G,F,E,D,C,B,A] 9. and so on until either U is found or open [. Assuming the graph is search space