For Python lab, I need to design an algorithm of a function to find the longest string from a list using an accumulator pattern. My function may return any one of them as shown in the picture. Currently, I learned python up to def (function) and return.

list return value ['for' 'he', 'is', 'a' 'very', 'good', 'fellow'] 'fellow" ['one', 'two'] either 'one' or 'two' [] Remember that algorithms implementing an accumulator pattern using a function have the following general structure: Given: Receive data from the calling program. Initialize the accumulator. Repeat for each element in a list If the current element matches then Update the accumulator Return the accumulator value. In this exercise, the function is given the list of strings to search and the accumulator needs to keep track of the longest word found so far in the loop through the list elements. When looking for the longest element, you'll want to initialize it to some really small word that couldn't possibly be longer than any of the words in the list