break these questions down and explain why the answers are these

1. How many colon does it the to color K0 ? 2. How many colors does it Gake fo color K6,9? In each question below circle either TRUE (I) or FALSE (F). 1. 1 If a graph has oo cyeles, then the graph is a tree. 4 T If a yraph is coneceted, then its complenent imie be conanected. 5. I (F) All graphs that can be colored in 2 -oolors are trees 6. (I) F All trees can be colored in 2-solors: 7. T(F) If a graple contains a cycle that includes all of the edger of the gnoph, then the cycle is an Fuler Cycle 1. (1) F Every grapb has an even manber of nodes of edd dejece 9. T(B) All Bapartite gephis are trees. 10(O) All ineer ace Bipartite maphe. H( (1) E Ifa griph has one face, then the graph has so cycles. 12(T) : If a geped has teore than one sparning trec, then the graph must lave a cycle. mininut iquanish tros. 14.(T) P is. T( (I) 16(T). trise proglicen die optinsal solution: eumiter er colon whin coloring a connected praph