|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
For a given array of price of items,you have to calculate the sum and average of all prices upto 2 decimal places.
First line of the input contains an integer T which denotes the number of test cases. Then T test cases follow. Each test case contains two lines.
The first line of each test case contains N denoting the number of items in the array.
The second line contains N space-separated integers - P1, P2, ..., PN denoting prices of items.
For each test case, print space separated sum and average of all the items resepctively.
1 2 3 4 5
2 55 85 656 52 554 545 5 2