it is a c++ assignment (Stacks, Queues and Complexity Analysis)

Complexity Analysis (5 points) For each of the following code snippets, determine its growth (asymptotic performance). That is determine its Big O class by approximating the number of instructions executed as a function of n (the number of elements). In your answer provide details of how you reached your conclusion. HINT: to help you better analyze, you may want first to try setting n to specific values like 5, 10, 15, ... to help you analyze how many times instructions get executed. Snippet 1: (1 point) for (i = sum = 0; i int binarySearch(const T arr[], int arrSize, const T& key) { int lo = 0, mid, hi = arrSize-1; while (lo