Given a directed graph with m edges and n nodes where every edge has weight as either $1$

or $2,$ find the shortest path from a given source vertex $$s$$ to a given destination vertex $$t$.$

Expected time complexity is O$($m$+$n$).$