Hint
4.1.11.1
.
How many edges does
\(K_n\)
have? One of the two graphs will not be connected (unless
\(j=1\)
).
in-context