Consider the following unsorted list: exam$\_$list $=[2,9,5,4,8,1,6]$ Using the insertion sort algorithm, say that the sorted sublist is currently $[2,5,9].$ What is the next item to be inserted into the growing sorted sublist? Group of answer choices $6841$