Please use python

Implement the function 'longest_sequence' according to the docstring provided. You may use the Stack and Queue classes provided in module 'adts' to create temporary Stack and/or Queue objects. These are the same Stack and Queue classes you have seen before. You must NOT create any other compound objects (lists, dictionaries, sets, etc.) You may create variables to store individual elements (counters, items that have been popped or dequeued, etc.) You may add doctest examples if desired. from adts import Stack, Queue def longest_sequence(q: Queue) -> int: "Return the length of the longest sequence in q with the same value. Queue q will contain the same elements in the same order before and after longest_sequence is called. Two items a and b are considered to have the same value if a == b. If there are no items in q, the longest sequence has length 0. Preconditions: - the items in q can be compared using ==, !=, , etc. >>> q = Queue() >>> q.enqueue(5) >>> q.enqueue (10) >>> q.enqueue (10) >>> q.enqueue (15) >>> longest_sequence(a) >>> q.dequeue() 5 >>> q.dequeue() 10 >>> q.dequeuel) 10 >>> q.dequeue() 15 >>> q.is_empty() True TODO: implement this function