you give integer n number node direct graph node label 0 n 1 each edge red blue graph selfedge parallel edgesyou give array rededges blueedge whereredEdgesi ai bi indicate direct red edge node ai node bi graph andblueEdgesj uj vj indicate direct blue edge node uj node vj graphReturn array answer length n answerx length short path node 0 node x edge color alternate path 1 path exist Example 1input n 3 rededge 0112 blueedge Output 011example 2input n 3 rededges 01 blueedge 21output 011 Constraints1 n 1000 rededgeslength blueedgeslength 400rededgesilength blueedgesjlength 20 ai bi uj vj n