# Matching Graph Drawing

How could I draw a graph that is connected, $3$-regular that has both a cut vertex and a perfect matching? I know every simple $3$-regular graph with no cut-edge has a perfect matching, but not sure how to draw a graph to meet these criteria.