ALL IN C$++.$ THANK YOU. IF SOMETHING WAS SCANNED WRONG BY CHEGG AND LOOKS OFF, PLEASE JUST LOOK AT THE ATTACHED PICTURE.

Question I $(20$ points$)$: For each question, circle the best answer. Each question is worth $2$

points.

Which of these sorting algorithms does the most operations, counting both key

comparisons and assignment operations?

a$.$ Insertion sort

c$.$ Bubble sort

b$.$ Merge sort

d$.$ Quicksort

For an array with $n$ elements, how long does binary search take?

a$.O(n)$

c$.O(nlo{g}_{2}n)$

b$.O(n^2)$

d$.O(lo{g}_{2}n)$

A class with any virtual functions should always define a virtual

a$.$ constructor

c$.$ destructor

b$.$ assignment operator

d$.$ mutator

The friend keyword allows a nonmember function to access

a$.$ static members

c$.$ protected & private members

b$.$ private members

d$.$ protected members

If a class uses dynamic allocation, correct behavior typically requires that the class

include a definition for which function:

a$.$ an accessor for the pointer

c$.$ a copy constructor

b$.$ a mutator for the pointer

d$.$ an increment operator