Using Selection Sort, show the state of the array at the end of each iteration through the outer loop (i.e., after each full time/sweep/traversal through the array using the inner loop) until the algorithm is complete/finished. The Selection Sort Algorithm is given, for reference:

Given the following array data, answer the following questions:int[ ] arr = {8,4,5,7,2,6,9,1}   How many checks (i.e., iterations through the loop) would be needed to return the index of the value 6 (or -1 if it can’t be found) using Linear Search? The Linear Search Algorithm is given, for reference:

When instantiating/creating a class that uses generics, you MUST give a type for the generics (i.e., for ArrayList, which uses generics, it is NOT possible/valid to perform the instuction: Arraylist arr = new ArrayList(); ).

Assume we wanted to include a new specialized class called “Doctor” that inherited from MedicalStaff. Select all the types that Doctor would be through Polymorphism (i.e., which data types would return true if you performed “Doctor instanceof “).

How many checks (i.e., iterations through the loop) would be needed to return the index of the value 3 (or -1 if it can’t be found) using Linear Search?

When instantiating/create a class that uses generics, ANY non-primitive type can be used for the generics (i.e., it would be valid to give ANY non-primitive type for ArrayList’s generics).

Which of these compounds has four α-hydrogens? Select all the answers.  

True or false. Generally, impurities increase melting point ranges.  

Label the main parts (A through E) of a reflux apparatus. A: [a] B: [b] C: [c] D: [d] E: [e]

True or false.  Extracting solvents should be immiscible with one another.