Undirected graph has vertices V={0,1,2,3,4} and edges E={(0,1); (0,2); (1,3); (1,4); (3,4)}. In which order vertices may be visited by breadth first traverse algorithm if started at vertex 0? (several answers may be selected)