LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should...

you must include a while loop in this function

you should not us any of the following:

• 
  dictionaries or dictionary methods
  


• 
  try-except
  


• 
  break and continue
  statements


• 
  recursion
  


• 
  map / filter
  

Extracted text: LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all! from typing import Any, List


Extracted text: def longest_chain(lst: List[int]) -> int: II II II Given a list of integers, return the length of the longest chain of 1's that start from the beginning. You MUST use a while loop for this, and are not allowed to use a for loop. Hint: A good way to start is to define a stopping condition, and have a variable that keeps track of how many 1's you've seen thus far, if any. Precondition: will only contain the integers 1 and 0. >>> longest_chain([1, 1, 0]) 2 >>> Longest_chain([0, 1, 1]) >>> longest_chain([1, 0, 1, 1]) 1 pass