HHackerRank Time Complexity Iteration (While loops) Counting only+,,1I8,,as basic operations, determine the exact number of basic operations that would be performed when the following code fragment is executed for the given values of n and t. fx211 i=i+1 or k Ln xeange (n) print Input Format The first line contains a single integer: q The number of queries to be processed Each of the next q lines is a single query consisting of two integers t n The values of t and n in the code fragment Constraints 1 Sq 100 1 n 105 1 St3 10 Output Format q lines, the ith line containing the number of basic operations that would have been executed by the code fragment for the ith query Sample Input 0 5 3 7 5 Sample Output 0 23 30 Explanation 0 Query 1 Given that t-5 and n-3, we can perform a dry run of the code fragment to examine the total number of operations performed after each pass of the while loop. (We'll consider the initial conditions 'after pass 0) Pass #sx 0 03<. f: for loop: if: exits clearly a total of basic operations were performed by the code fragment first input. ops pass counttotal count query this time t-7 and n-5 table looks like following: s x eor second i import math os random re sys complete findnunope rations function below. def findnumoperations n : fptr- open q int itr in range tninput tint result fptr.write fptr.close>