[Assess students' ability to trace bubble sort, selection sort, and insertion sort on small lists (up to 6 items): show each pass/step, record and total the number of swaps and comparisons for each algorithm, and compare their behavior on at least two example lists (e.g., already-sorted and reverse-sorted). Require a brief explanation of which algorithm performed best for each list and why, using the counted swaps/comparisons to support the analysis.]