In an undirected graph, how is an edge $($u$,$ v$)$ different from an edge $($v$,$ u$)?$

Group of answer choices

$($v$,$ u$)$ can only go from v to u

$($u$,$ v$)$ can only go from u to v

$($u$,$ v$)$ and $($v$,$ u$)$ are the same

$($u$,$ v$)$ and $($v$,$ u$)$ are different edges