$(3)$ Transform the following graph into $K_{3,3}$ by applying the following $3$ types of operation $($as many times as you like, in whatever order you like$)$:

Edge deletion: Remove an edge without changing the vertex set.

Vertex deletion: Remove a vertex and all edges incident to that vertex.

Edge contraction: Remove an edge and merge its two endpoints into a single vertex. $($Pictorially$,$ "Shrink the edge to length zero".$)$

$($Pictures are sufficient explanation.$)$