(Solved): Please answer You can use any programing language java, python are c Beautiful element An elemen ...

Please answer You can use any programing language java, python are c

Beautiful element An element in the array \( A \) at an index ind is called beautiful if \( \sum_{i=0}^{i n d-1} A[i] \leq A[i n d] \). In other words, an element is beautiful if it is greater than or equal to the sum of elements before it. The first element of the array is always considered to be beautiful. You are given an array \( A \) of \( N \) integers. Task Determine the maximum number of beautiful elements in the array after rearranging the array. Example Assumptions - \( N=4 \) - \( A=[4,2,1,3] \) Approach You can rearrange the array as \( [1,2,4,3] \). - 1 becomes beautiful as there is no element before it. - 2 becomes beautiful as the sum of elements before it is \( 1 . \) - 4 becomes beautiful as the sum of elements before it is \( 3 . \) - 3 is not beautiful as the sum of elements before it is \( 7(1+2+5) \) wh is higher than 3 . Thus the answer is \( 3 . \) Function description Complete the function countBeautiful provided in the editor. This function takes the following 2 parameters and returns the required answer: - N: Represents the size of array \( A \) - A: Represents the elements of array \( A \) Input format - The first line contains a single integer \( T \) which denotes the number test cases. \( T \) also denotes the number of times you have to run the countBeautifuffunction on a different set of inputs.. - For each test case: - The first line contains an integer \( N \) denoting the size of the array. - The second line contains \( N \) space-separated integers denoting each element of the array. Output formatFor each test case in a new line, print the maximum possible number of beautiful elements. Constraints \( 1 \leq T \leq 100 \) \[ \begin{array}{l} 1 \leq N \leq 10^{5} \\ 1 \leq A[i] \leq 10^{9} \end{array} \] Code snippets (also called starter code/boilerplate code) This question has code snippets for C, CPP, Java, and Python.