How does Selection Sort work?

a$.$ It repeateclly selects the smallest $($or largest$)$ element from the unsorted portion and moves it to its correct position

b$.$ It selects a pivot element and partitions the array around it

c It divides the array into smaller sub$-$arrays and sorts them recursively

d$.$ It compares adjacent elements and swaps them if they are in the wrong order