$26$

$6$ points

Relation to the CLIQUE problem that we say in class. Consider the following graph G:

Circle the nodes that represent the largest clique in G$.$

Draw the complement graph $\frac{?}{\text{b}\text{a}\text{r}}(G)($the complement graph $\frac{?}{\text{b}\text{a}\text{r}}(G)$ has the same nodes as $G$ but if $2$ nodes are connected in $G$ then they would not be connected in $\frac{?}{\text{b}\text{a}\text{r}}(G)$ and if they are not connected $G$ then they would be connected in $\frac{?}{\text{b}\text{a}\text{r}}(G)$

Circle the nodes that represent the largest dsi in $\frac{?}{\text{b}\text{a}\text{r}}(G)$ What do you notice?