For each of the following situations, choose the sorting algorithm we studied that will perform the best. (For some questions, more than one answer might be acceptable, but you only need to list one.) We are working on an unstable system. When we try to run our sort on large arrays, sometimes the sorting algorithm will be forced to stop running in the middle of execution. (The array will be left in whatever state it was in at the time the algorithm stopped.) But we can start the algorithm over and run it again later. So we want to choose an algorithm that will make progress toward the goal even if it does not always finish executing.
(checkbox format)
Insertion sort
Selection sort
Heap sort
Merge sort

In the film "epic 2015," epic is the name for:

Ihave been given the number of guns per 100, and the total firearm-related deaths per 100,000. i have to find the actual number of guns per country and actual number of gun-related deaths. if somebody could show me how to do 1 question, i can finish the rest, i am just confused. tia

Consider the following statements: struct nametype{string first; string last; }; struct coursetype{string name; int callnum; int credits; char grade; }; struct studenttype{nametype name; double gpa; coursetype course; }; studenttype student; studenttype classlist[100]; coursetype course; nametype name; mark the following statements as valid or invalid. if a statement is invalid, explain why.a.) student.course.callnum = "csc230"; b.) cin > > student.name; c.) classlist[0] = name; d.) classlist[1].gpa = 3.45; e.) name = classlist[15].name; f.) student.name = name; g.) cout < < classlist[10] < < endl; h.) for (int j = 0; j < 100; j++)classlist[j].name = name; i.) classlist.course.credits = 3; j.) course = studenttype.course;