I got this questions in Microsoft OA I wonder what the right answers would be :\n\nGiven a list of 1000 elements which of the following number is the largest?\nA. The number of all possible subses of a given list\nB. The number of all possible pairs of elemenst from a given list\nC. The number of all possible permutations of a given list\nD. 10,000,000,000,000,000\n\nYou are given an array with 10^8 elements and you must compute the sum A[J] + A[K] for every possible pair of elements in the array. How long will this computation take on a single mainstream computer?\n\nA: milliseconds \nB: seconds \nC: minutes \nD: hours \nE: more than a few hours

I got this questions in Microsoft OA I wonder what the right answers would be :\n\nGiven a list of 1000 elements which of the following number is the largest?\n