1. Answer T if the graph or tree exists as described and F if it does not. 1. Connected graph with 9 vertices and 9 edges 2. Circuit free graph with 10 vertices and 10 edges 3. Connected graph with 2...

Extracted text: 1. Answer T if the graph or tree exists as described and F if it does not. 1. Connected graph with 9 vertices and 9 edges 2. Circuit free graph with 10 vertices and 10 edges 3. Connected graph with 2 vertices and one edge that's not a tree 4. Forest with 10 vertices and 9 edges 2. Answer T if the graph or tree exists as described and F if it does not. 1. Tree with 10 vertices and 20 edges 2. Graph with 20 vertices and 19 edges, but not a tree 3. Connected graph with 20 vertices, 10 edges, and a circuit 4. Tree with 10 vertices and total degree 18 3. Given the following adjacency matrix: ro 1 1 0 0 01 1 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0. 0 10 0 [0 1 0 0 0 o] with row 1 representing node A, row 2 representing node B, and so forth. Assume node A is the root node. What is the height of Node F? Your answer should be an integer: