1. What is the need for virtual memory?
2. Delete Middle Element from Stack You are provided with a stack ARR of size 'N+1'. Your task is to delete the middlemost element so that the size of the resulting stack becomes 'N'. Recall that a stack is a linear data structure where both insertion and deletion of elements occur at the top, following the LIFO (Last In First Out) or FILO (First In Last Out) principles. Input: The first line of input consists of an integer 'T', the number of test cases.Each test case begins with an integer 'N', indicating that the stack initially contains 'N+1' elements.The following line in each test case includes 'N+1' space-separated integers representing stack elements. Output: For each test case, output 'N' space-separated integers showing the stack after the middle element is removed.Each test case's result should be printed on a new line. Example: Input: ARR = [1, 2, 3, 4, 5], N = 4Output: ARR = [1, 2, 4, 5]Input: ARR = [5, 6, 7, 8], N = 3Output: ARR = [5, 7, 8] Constraints: 1 <= T <= 100 1 <= N+1 <= 3000 0 <= data <= 10^9 Note: No need to print anything; focus on implementing the function correctly.
3. Anagram Pairs Verification Problem Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the other string. Input: The input consists of a single line with two space-separated strings, Str1 and Str2. Output: Print True if the two strings are anagrams, and False otherwise. Example: Input: str1 = "spar", str2 = "rasp" Output: True Constraints: The strings will not contain spaces, except to separate one from the other. Both strings consist of lowercase characters. 1 ≤ N ≤ 105 where N is the length of Str1. 1 ≤ M ≤ 105 where M is the length of Str2. Time Limit: 1 second Note: The solution must be complete, ensuring all test cases pass to receive full marks.
4. Explain the normal distribution.