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

3. (6 pts) internally in the computer, with few exceptions, all numerical computation is done using binary numbers. output, however, often uses ascii, which is formed by appending 011 to the left of a bcd code. thus, an algorithm that directly converts a binary integer to a bcd integer is very useful. here is one such algorithm 1) draw lines to the left of the binary number to bound the expected bcd decades. (each decade is a group of 4 bits.) move the binary number one bit to the left. add 0011 to each bcd decade containing a binary value> 0100 repeat steps 2-3 until the last bit in the binary number has been moved into the least significant decade position. (note that when the last bit has been shifted into bcd decade, step 3 is not repeated.) read the bcd result. 2) 3) 4) 5) a) execute the algorithm for the binary number 1101101 b) execute the algorithm for the binary number 01110101110 4. (4 pts) represent the decimal number 3568 in bcd; excess-3 code; ascil; and hex.

To check spelling errors in a document, the word application uses the to determine appropriate spelling. internet built-in dictionary user-defined words other text in the document

Of the following pieces of information in a document, for which would you most likely insert a mail merge field?