Consider graph G$\_$n which is obtained from two copies the complete graph K$\_$n which are connected by matching of size n$.$ Determine the clique, the independent and the chromatic number of the graph Sn Explain!Formally, G$\_$n $=($V$,$ E$)$ where V $=($ v$\_1,...,$v$\_$n$)$U$($w$\_1,...,$w$\_$n$)$ and E $=(\{$v$\_1,..$v$\_$n$\}/2)$U$(\{$w$\_1,...,$w$\_$n$\}/2)$U$\{\{$v$\_$i$,$w$\_$i$\}|$ i belongs to $\{1,...$n$\}\}.$ Consider n $>=2.$