Select the correct Bellman Equation's) for the shortest weighted path problem na digraph with negative-weight edges and no negative cycles OPT(v, j) = the length of shortest vrst path that uses at most jedges. Select one or more 0 OPT(v.) = 0 ifrtalj min(OPT(0,1-1). + min.OPT w.) - 1)) otherwise None of the other options is correct 0 OPT(v, j) = { 00 min{OPT(0,j-1), Le + min.:OPT(us, j - 1)] otherwise 0 fet paid OPT(0,1)= { ifuandjad min{OPT(1j-1),min, LOPTI, 3-1))) oleman