1. What is binary search?
2. Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become: [4,5,6,7,0,1,4] if it was rotated 4 times. [0,1,4,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[1], a[2], ..., a[n-1], a[0]]. Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array. You must decrease the overall operation steps as much as possible.
3. How do you calculate the rate when given the amount, principal, and time?
4. What are Hooks and lifecycle methods in React?
5. Sort Array of Strings Problem Statement Given an array of strings ARRSTR[] of size N, and a character C, your task is to sort the ARRSTR[] array according to a new alphabetical order that starts with the given character C. Input: The first line contains an integer 'T', representing the number of test cases.Each test case contains:- An integer 'N' and a character 'C'.- A sequence of 'N' space-separated strings that are elements of the array. Output: For each test case, output a sequence of 'N' space-separated strings sorted according to the new alphabetical order. Example: Input:23 dapple banana cherry4 wdog eagle apple frogOutput:cherry apple bananaapple dog eagle frog Constraints: 1 <= T <= 100 1 <= N <= 1000 'C' is a lowercase English alphabet 1 <= |ARRSTR[i]| <= 9 for 1 <= i <= N Note: You do not have to print anything in your implementation. Just return the sorted array.