Given the following directed acyclic graph $($DAG$)$ with vertices labelled as numbers, perform topological sorting on the graph:

Vertices: $\{5,3,2,8,6\}$

Edges: $(5,3),(5,2),(3,8),(2,8),(6,8),(6,3)$

Show each step of the sorting process and the final sorted result.