I need help in Algorithms and data structures

Calculate time complexity in Big-O notation for the following equation.

T(n) = 1² + 2² + 3² + .. + n²

Find the time complexity of the following code segment. Represent the result in Big-O notation.

Statement Frequency 1. C=0; 2. Sum=0; 3. >num; 5. While(num !=-1) 6. St Sum=sumtnum; Cin>>num; 9. Mean=sum/c; Apply binary search algorithm on the list of numbers given below to search the following numbers. a. 67 b. 23 12 | 23 34 45 56 67 78 89 90 99