Help in c++.

s2004- Data Structures and Algorithms OMS2004-2017 ) Linked Lists Tutorial 5 Consider the following algorithm: void Algorithm (intall, int size)( e arswer ut of 10.00 queston 1. int value; 2. int q 3, for (int p = 1; p value 66 q >= )( value- alpl; q = p-1; q-1; 8. 9. 10, q = a[q+1] = value ; 12.) (a) What do you think is the purpose of the algorithm? Copy the first element across the array (b) What is the Big-O notation for the worst-case caoran array from fargest to smallest an array fron all-st to largest O(n) o(n!) are given the following array, a (56,81.4.7.30, if we print the array between lines 3 and 4, w output at the tollowing iterations of the for-loop. Given you answer in the same format as the array above. eg SAMSUNG