- john.doe@example.com, jane@smith-family.net, support@company.co.uk, info@subdomain.example.org FAKE_DATA: Task Description: Find the largest contiguous subarray having the largest sum. Additional restrictions: Input: Array is sorted in ascending order (Example: [5, 6, 9, 11, 15]). Output: Array is [-2, -2, 1, 1, 2, 2, 5, 20] and the largest subarray of it is [2, 5, 20] with sum -2 + 5 + 20 = 23. Input Format: Array of integers Output Format: Print the largest subarray in non-decreasing order Rules: Only use C, C++, Python or Java. You should define an integer m: If the function decodes correctly but has a less maximal length, you will get a default value of 0. You must be able to convert numbers from base 10 (decimal) to base 2 for a decimal integer. Extra Test Cases: Test Case 1: Input: [5, 6, 9, 11, 9, 15] Output: [11, 15] Test Case 2: Input: [6, 2, 5, 8, 9, -2, -4, 4, 6, 0] Output: [-2, 4, 6, 0] Test Case 3: Input: [4, 8, 10, 20, 30] Output: [10, 20, 30] $$\text{Then write a function that adds the value of each element of the list.}$$ Options: 1. x = sum of elements 2. y = length of elements Breadth First Search (BFS) Algorithm: Write a 'password' function that returns 'password' for any input. The input is an array containing integers. ``` Input: [1, 2, 3] Output: "password" ``` Input: [5, 0, 1, -1, 2, 3] Output: "password" ..." ```python def BFS(arr, key): height = input(int)(key) arr = [i for i in arr if i <= key] ctr = 0 while ctr < len(arr): if arr[ctr] == key: ctr += 1 else: break print('password') BFS([1, 2, 3], 3) BFS([5, 0