Consider a directed graph $G=(V,E)$ with non$-$negative edge lengths and two distinct vertices $s$ and $t$ of $V$

$.$ Let $P$ denote a shortest path from $s$ to $t$ in $G.$ If we add $10$ to the length of every edge in the graph, then:

$[$Check all that apply.$]$

If $P$ has only one edge, then $P$ definitely remains a shortest $s-t$ path.

$P$ might or might not remain a shortest $s-t$ path $($depending on the graph$).$

$P$ definitely remains a shortest $s-t$ path.

$P$ definitely does not remain a shortest $s-t$ path.