Problem $1\mathrm{.}6.(3$pts$)$ Name the algorithms that can be implemented in a stable way for the given candidates: $(1)$ insertion sort. $($ii$)$ merge sort, $($ii$)$ selection sort. $($iv$)$ bubble sort, $($v$)$ heapsort. $($vi$)$ quicksort. In your answer $($Yes or No$)$ for each of the algorithms. you should provide one or fro lines of codes that is the key to make sure the stable property can $($or cannot$)$ be ensured