Math Problem Solver - Copy this React, Tailwind Component to your project

Mr. Thomas is a very well known mathematician. He went to an education fair where he noticed a lot of brilliant students. So, by seeing their talent, he has given them a problem to solve The problem was num=P₁+P++P where P, is an integer and will be in the format of XYZ where X should be considered as base and Y is considered as power and Z represents the number of digits to be considered as power. For example, given an equation in the form of num=3011+1122 to solve the equation, it should be calculated in the form of num=301+1122 31 where 1 and 2 marked as red will be ignored. Can you help students with a program to solve the given problem. Input Format: The first line of input contains the integer N, the total number of operands in the equation Each of the following N lines contains the integer P, from the equation. Output Format: The first and only line of output must contain the value of num from the given equation. Constraints: IN (1≤ N ≤1000) P, (10 SP, ≤ 9999, (=1 N) inum (num ≤ 10 Sample Input 1: 1 3011 Sample Output 1: 30 Explanations 1: The number of operands in the equation, N. 1def solution(N, arr): # N is the number of operands in the equation and arr contains the integers Pi from the equations 2 3 4 5 6 7 8 9 10 result=0 for operand in arr: operand_str=str(operand) base int (operand_str[:2]) power int(operand_str[2]) result + base** power print(result def main(): 11 12 13 n=int(input()) arr = [] 14 15 16 for i in range(n): arr.append(int(input())) solution(n, arr) 17 main() give code