simple sorting in the selection sorta the largest keys accumulate on the left (low indicesb minimum key is repeatedly discovered number of items must be shifted to insert each item in its correctly sorted position the sorted items accumulate on the right true or falseifin particular sorting situationswaps take much longer than comparisonsthe selection sort is about twice as fast as the bubble sort copy is times as fast as swap what is the invariant in the selection sort in the insertion sortthe "marked playerdescribed in the text corresponds to which variable in the insertsort java programa in out temp [out in the insertion sort"partially sortedmeans that some items are already sortedbut they may need to be moved most items are in their final sorted positionsbut few still need to be sorted only some of the items are sorted group items are sorted among themselvesbut items outside the group may need to be inserted in it shifting group of items left or right requires repeated in the insertion sortafter an item is inserted in the partially sorted groupit will never be moved again never be shifted to the left often be moved out of this group find that its group is steadily shrinking