1. Right View of Binary Tree Given a binary tree of integers, your task is to output the right view of the tree. The right view of a binary tree includes the nodes that are visible when the tree is observed from the right, listed from top to bottom. Input: The first line contains an integer 'T', the number of test cases. Each test case consists of a line of integers representing the level order traversal of the tree. Use -1 for null nodes. Output: For each test case, print the right view of the tree on a new line. Example: Input: 11 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Output: 1 3 6 7 Constraints: 1 <= T <= 100 1 <= N <= 105 -109 <= data <= 109 Note: No need to print anything explicitly. The function should return the appropriate output.

2. Buy and Sell Stock Problem Statement Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell transactions to maximize your profit. Your task is to determine the maximum profit that can be achieved. Remember, you must sell the stock before you can buy again. You can enlist Mr. Mehta's help if needed. Input: T (number of test cases)For each test case:N (number of days)N space-separated integers signifying stock prices for each day Output: For each test case, output the maximum profit possible on a new line Example: Input: T = 2Test case 1: N = 5, Prices = [3, 3, 5, 0, 0]Test case 2: N = 5, Prices = [7, 6, 4, 3, 1] Output: Max profit for test case 1: 6Max profit for test case 2: 0 Constraints: 1 ≤ T ≤ 10 1 ≤ N ≤ 5 * 104 0 ≤ price ≤ 103 Note: - Buying a stock and then selling it constitutes one transaction.- You cannot engage in multiple simultaneous transactions, meaning you need to sell a stock before you buy again.- Ensure the function is implemented as specified, there is no need for additional print operations.

3. Multiply Linked Lists Problem Statement Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list. Explanation: The multiplied list should be a linked list representation of the product of the two numbers. Each node contains a single digit. Input: The first line contains an integer T, the number of test cases.For each test case, the first line contains elements of the first linked list, separated by spaces and terminated by -1.The second line contains elements of the second linked list, separated by spaces and terminated by -1. Output: For each test case, print the linked list representing the product, with elements single-space separated and terminated by -1. Example: Input: 23 4 2 -14 6 5 -15 6 -17 8 9 -1 Output: 1 5 8 1 0 -14 4 2 0 4 -1 Constraints: 1 ≤ T ≤ 10 1 ≤ N, M ≤ 100 0 ≤ data ≤ 9 for any node in the list Time Limit: 1 sec Note: You are not required to print anything; it has already been handled. Implement the function as instructed.

4. What is HIRA?

5. What is the full form of ISO?