For each of the following scenarios, choose the best sorting algorithm(s) from the list below. Then, justify your choice by describing what properties of that sorting algorithm make it the best choice, and why those properties are useful in this particular scenario. Maximum Length Per Question: 2-3 sentences. Sorting algorithms: Insertion sort, Selection sort, Heap sort, Merge sort, Quick Sort Q4.1 Game Programming 3 Points You are a game programmer in the 1980s who is working on displaying a sorted list of enemy names that a player has encountered during their gameplay. Since it is a game, you want to display the names of the enemies as fast as possible, but because it is the 1980s, your customers are used to and will be okay with occasional slow loading times. Additionally, the game is intended to run normally on consoles that don't have much memory available. Imagine that you are sorting a small set of computer files by their file name. You realize, however, that each computer file is huge and takes up a lot of disk space, so you do not want to copy excessively when sorting. In fact, even just moving and rearranging these large files is expensive, so you don't want to move them often. (Hint: You may find it useful to refer to visuals of the sorting algorithms. Lecture slides and https://visualgo.net/en/sorting are good resources for remembering these general ideas.) Imagine that you are a NASA software engineer. You're assigned a task to sort data you receive from a probe on Mars, in which each piece of data includes time and temperature. The sensors on this probe capture very large amounts of data. The data is already given to you in sorted order of earliest to latest time, but you want to sort them by temperature, where ties in temperature are ordered by time.