DO WELL!!!

L$.$ For each of the following graphs do the following:

$($a$)$ Find all its induced, unlabeled, not necessarily connected subgraphs. Enumerate them

$($b$)$ For each subgraph you found at $($a$),$ give within parentheses the number of distinct labeled subgraphs that are isomorphic with that subgraph.

$K_5$

$C_5$

$K_{2,3}$