Isomorphism and Subgraphs · Hard problem

Let $G$ have vertices $1,\ldots,9$ and edges $12,13,14,23,24,34$ (a $K_4$ on $\{1,2,3,4\}$), together with the pendants $15,26,37,48$ and the extra edge $59$. Let $S$ be the $5$ vertices of $G$ with the SMALLEST degree. How many edges does the induced subgraph of $\overline G$ on $S$ (i.e. $\overline G[S]$) have?