Write a python function count longest ascthat returns the length of the longest run of ascending numbers in a list of integers. an ascending run is a sequence of adjacent numbers which is strictly increasing. your function must obey the following restrictions: . your function cannot use recursiorn * your function must go through the list exactly once you cannot create any new lists) examples: countlongestasc([]) -> 0 - - * count longest asc ([9, 1, 7, 8, 9, 4, 2]) -> 4 the sequence 1,7, 8, 9 (length 4) is the longest increasing subsequence. count_longest_asc ([6, 4, 4, 2]) -1 there are no cases where there is an increase from one element to the next, so the longest sequence is