What is the final distance array if we applied Dijkstra's Algorithm to this Graph?

The starting vertex is $0.$

Your answer should be in the format $1,2,3,$dots, where position $0$ represents the distance to vertex $1,$

position $1$ to vertex $2$ and so on$.($Please answer as soon as posible$)$