it should be disconnected.
I will take worst case case to prove it .
As Each vertex has degree $>=5$,let's assume it the minimum i.e $5$
By handshaking lemma,
$\sum \text{degree of vertices}=2 \times |\text{edges}|$
$5 \times 10= 2\times |\text{edges}|$
$|\text{edges}|=e$
$e=25$
But to be connected, minimum number of edges should be
$e>=\binom{n-1}{2}+1, \text{n=number of vertices}$
But $e=\binom{9}{2}+1=37 \nleqslant 25$
Hence disconnected