Question 1: Please write a piece of C++ code for selectionsort algorithm for an array of integer items.

The function protoype is:

void selectionsort (int data[  ], size_t n);


Question 2: What is the Big-O of the selectionsort algorithm?

Question 3: Please analyze the best case, worst case and average case times.