Consider a graph with the following adjacency matrix:

$([0,1,0,0],[0,0,1,1],[0,0,0,1],[1,0,0,0])$

What is a Chinese postman tour for this graph if we number the vertices from $1$ to $4($left to right, top to bottom$)?$

$1,4,2,3,1,4,2,1$

$1,2,3,4,1,2,4,1$

$2,4,1,3,1,3,4,2$

$1,4,2,1,4,3,2,1$