Problem 1: You are given an array of integers array[] and an input x. You have to find ifthere are any two numbers in your array such that the sum of their square equals to x2. In otherwords, you have to find out if there is any pair of i,j such that array[i]2 + array[j]2 = x2. If there are such pairs, you should print all such (i,j). Otherwise print There are no such pairs. Example: array[]: 2, -4, 6, 3, 9, 0, -1, -9 x: 5 You have 1 pair: (-4)2 + (3)2 = 52, so your output would be corresponding array indices: (1, 3)