complement of a complete bipartite graph

Question

I am a beginner at the topics, so I need some helps to understand. For example $K_{1 ,7}$ is a complete bipartite graph.

1. Express the number of edges in $K_{1,7}^C$.
   I know that : $The~number ~of ~edges ~in ~a ~complete ~bipartite ~graph~ K_{p,q} = pq$ so $K_{1,7} = 7$
   
2. Is that $K_{1,7}^C$ connected or not? I know that the meaning of connected and I also know that if $K_{1 ,7}$ connceted then $K_{1,7}^C$ not conneted.
3. If $K_{1,7}^C$ not connected, how many connected component there? (I have no idea about this.)
4. what is the degree sequence $K_{1,7}^C$?
   I need some advise and explanation, that why I use $K_{1 ,7}$.
   My Solution (I could not draw it so I add image):