Can anyone help me solve this problem? I am so confusing.

Give a distributed algorithm to 6-color a planar graph. has n vertices and m edges. Your proof should be based on the following two Assume the graph 1. Use Euler's polyhedron formula (which states that if n 2 3 then m 2. Use the first part above to give the distributed coloring algorithm, The celebrated four color theorem states that planar graphs are 4-colorable Give a distributed algorithm to 6-color a planar graph. has n vertices and m edges. Your proof should be based on the following two Assume the graph 1. Use Euler's polyhedron formula (which states that if n 2 3 then m 2. Use the first part above to give the distributed coloring algorithm, The celebrated four color theorem states that planar graphs are 4-colorable