Implement the following pseudocode for breadth-first search using python 3 following the test cases. Thank you.

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 [