Write a function bubble$\_$sort that implements the bubble sort algorithm. The input to the function should be unsorted, a list or numpy array. The function

should return two things:

the modified list, sorted in non$-$decreasing order;

a list of lists, containing a copy of the full list being sorted at the current step. You can use the copy method to copy a list $($for example,

unsorted. copy $()$ constructs a copy of the original list$),$ and the append method to add to a list $($for example,

all$\_$lists.append$($unsorted$.$copy$())$ adds a copy of the current unsorted list to the list$-$of$-$lists all$\_$lists $).$ This output should include the initial

input unsorted as the first entry and the final sorted list as the last entry.