ONly number 8

7. Give a definition of Graph Embedding, Planar Embedding. Is the following graph a planar graph? G={V,E} V={a,b,c,d} E={{a,b},{b,c},{c,d},{a,d},{a,c},{d,b}} 8. Show how BFS and DFS will work on the following directed graph and the order in which nodes will be discovered starting with Node A. G=(V,E); V={A,B,C,D,F}; E={(A,B), (A,C), (A,D), (C,D), (B,F),(D,F)}