Question $30(10$ points$)$

$\backslash$table$[[1.$ Degree of a vertex,$2.$ Totally ordered set,$3.$ Spanning tree$],[4.$ Complete graph,$5.$ Well ordered set,$6.$ Simple graph$],[7.$ Directed graph,$8.$ Edge connectivity,$9.$ Reflexive Closure of R$],[10.$ Literal,$11.$ Simple circuit,$12.$ Minterm$],[13.$ Vertex connectivity,$14.$ Full binary tree,$15.$ Path in a graph$]]$

From the above list match the number of the name with the definitions below. Note: there are more labels $(1$ to $15)$ than definitions and that a given label only gets used once. The smallest reflexive relation that contains $R.$ where every pair of elements are comparable.

A A Poset A Poset loops or multiple edges. elements of $V.$ A A

A

A graph with no vertex. $$ A The least number of vertices in a vertex

$$ A A path from a vertex to itself with no repeated

A

A Boolean variable or its complement. A Boolean variable or its complement.

A

Every internal vertex has exactly $2$ children. subgraph with no circuits that contains every vertex.