Python only.

(50 pts) Implement bubble sort using the following pseudocode as design bubbleSort (nums) if there are less than two elements return nums else for each element i, 0 to length of nums -1 for every element j that hasn't been sorted, 0 to length of nums-i-1 if nums[j] nums [j+1] temp nums[j] nums[ nums[j+1] = temp JJ nums [j+1] = return nums