I need help with a problem in my assignment. Thanks.

public void sort( int [l vals) if(vals != null &&valslength !=0){ for(int i=1; icyals.length,itt){ int temp vals[i]; int j 1; while(po && vals(j-1)>temp) { valljl- valj-1] valsmp; 1) Using BigO notation what is the worst case time complexity for this algorithm? 2) Using BigO notation what is the upper bound on the number of swaps excuted in the worst- case? 3)Using BigO notation what is the best case time complexity for this algorithm? 4)) Using BigO notation what is the upper bound on the number of swaps excuted in the best- case