1. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, each consisting of a certain number of fruits. Kevin wants to eat at least 'M' fruits. He is looking to set a marker as high as possible such that if he eats the number of fruits in the i-th bucket minus the marker, the total must be at least 'M'. Input: The input begins with a single integer 'T', the number of test cases.Each test case consists of: - Two space-separated integers 'N' (number of buckets) and 'M' (minimum fruits to eat).- A second line with 'N' space-separated integers indicating the number of fruits in each bucket. Output: For each test case, print the marker value needed, with each output on a new line. Example: Input: 14 3010 40 30 20 Output: 20 Constraints: 1 <= T <= 10 1 <= N <= 104 1 <= M <= 106 0 <= ARR[i] <= 104 Note: It is guaranteed that the total number of fruits in all buckets is greater than 'M'. Kevin can only eat fruits from a bucket if the bucket has more fruits than the marker.
2. What is a computer system?
3. How do you find the XPath for elements in Selenium?
4. Write code to balance parentheses.
5. What are the differences between an array and a linked list?