Problem 2. Count the total number of basic operations executed during running of the given pseudocode in the worst case. Ignore operations in the headers of for loops and return operation. bool is_palindrome(strings) { int size = s.length();//takes constant time string reverse(size); //takes constant time int u = 0; for(int j = size - 1; j >= 0; i--) //ignore the operations in this line reverse(u++] = s[j]; for(int j = 0; j