Problem 1. (1) Count the exact number of basic operations executed during running of the given pseudocode. Ignore operations in the headers of for loops and return operation. (2) Express the running time T of the algorithm as the sum of all basic operations. (3) Express the running time T of the algorithm using big-o notation. void lucky( int array[], int n) { // n is the size of the array for(int j = 0; j*j*j