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

Which of the following is a difference between the systems development life cycle (sdlc) and extreme programming (xp)? the sdlc model has a separate planning and analysis phase, whereas xp combines both the phases into one phase.in the sdlc model, changes cannot be made to a system once it is delivered to the user, whereas the xp method delivers the system to the users and then make changes suggested by the user.the sdlc model develops an entire system at once, whereas xp uses incremental steps to improve an information system's qualitydevelopers following the sdlc model cannot go on to the next phase until the current phase is finished, whereas in xp, developers can move to any phase from the current phase.