A bubble sort can use a "swap$()"$ method to reorder adjacent items in the array being sorted.$$ Assume we have sort that sorts an array of numbers in ascending order.$$ What, if anything, is wrong with this swap$()$ method $($note the lines of pseudocode are numbered for identification$).$

$1.$ public static void swap$($num$[]$ myArray, num i$)$

$2.$ num temp $=0$

$3.$ temp $=$ myArray$[$i $+1]$

$4.$ myArray$[$i $+1]=$ myArray$[$i$]$

$5.$ myArray$[$i $+1]=$ temp

$6.$ return