1. What are the different Android components and concepts such as RecyclerView, ViewModel, ANR, and how do they function internally?

2. Given an array of integers representing the heights of bars in a histogram, find the largest vertical rectangle that can be formed.

3. Given an array of natural numbers in random order, find the first missing natural number in the array. For example, given the array [4, 6, 3, 1, 6, 8], the output should be 2. Given the array [1, 2, 3], the output should be 4.

4. Infix to Postfix Conversion Convert a given infix expression, represented as a string EXP, into its equivalent postfix expression. Explanation: An infix expression is formatted as a op b where the operator is placed between operands. A postfix expression is formatted as a b op where the operator follows the operands. For more details on infix and postfix expressions, refer to these links: Infix Notation and Postfix Notation. Input: The first line of input contains an integer 'T' denoting the number of test cases to run. Each test case consists of a single line containing a string 'EXP', which is a valid infix expression. Output: For each test case, print the corresponding postfix expression of the given infix expression. Each result should be printed on a new line. Example: Input: EXP = '3+4*8' Output: 3 4 8 * + Explanation: In the given example, multiplication is performed before addition, resulting in the postfix expression 3 4 8 * +. Constraints: 1 <= T <= 10 1 <= N <= 5000, where 'N' is the length of 'EXP' The expression can contain digits, lowercase English letters, and the characters ‘(’, ‘)’, ‘+’, ‘-’, ‘*’, ‘/’, ‘^’. Time Limit: 1 sec Note: You are not required to print anything; the function implementation will handle the output.

5. Write the test cases to delete a node from a linked list