The following graph is not spanning tree because it is not connected and contains cycles B A AI 01 The following is not connected graph The following graph is a spanning tree ( D G F H (A E D,CA,E,F,G is a simple path 0 1 0 TO 10 If A= 0 1 1 B= 1 0 0 1 1 1 0 1 0 then BOAT- Select one: 0 1 1 1 1 1 1 1 1 0 10 100 0 1 0 0 1 1 0 1 1 0 1 1 0 1 1 1 1 1 0 1 1