$1$question$)$ Find $($draw$)$ all non$-$isomorphic graphs $($i$.$e$.$ unlabelled graphs$)$ with $6$ vertices and $6$ edges for which the maximum degree of a vertex is equal to $4.$

$2$ Question A$.$ How many subgraphs of $K_n$ are isomorphic to $K_{3,5}?$

B$.$ How many subgraphs of $K_{n,n}$ are isomorphic to $K_{3,5}?$