Answer the following statements true (T) or false (F)

1) The selection sort is a simple and efficient algorithm.
2) After the ith iteration of an ascending order selection sort, the smallest i
items of the array will be sorted in increasing order in the first i elements of the array.
3) Insertion sort is a simple and inefficient algorithm.
4) At the ith iteration of the insertion sort algorithm, the array will be sorted.
5) The merge sort algorithm sorts an array by splitting it into two equal-
sized subarrays, sorting each subarray and merging them in one larger array.

1) F
2) T
3) T
4) F
5) T