Use Python Code Correctly to solve this problem. Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Input: nums [100,4,200,1,3,2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. =

CAN THIS PLEASE BE DONE In PYTHON? Input a list of employee names and salaries and store them in parallel arrays.  End the input with a sentinel value. The salaries should be floating point numbers  Salaries should be input in even hundreds.  For example, a salary of 36,510 should be input as 36.5 and a salary of 69,030 should be entered as 69.0. Find the average of all the salaries of the employees.  Then find the names and salaries of any employee who's salary is within 5,000 of the average.  So if the average is 30,000 and an employee earns 33,000, his/her name would be found.  Display the following using proper labels.    Save your file using the naming format  LASTNAME_FIRSTNAME_M08 FE.  Turn in your file by clicking on the Start Here button in the upper right corner of your screen.     1.Display the names and salaries of all the employees.  2. Display the average of all the salaries 3. Display all employees that are within 5,000 range of the average.