Find8 ldr r0,=lstl ; point to list length f2 ldr r1,[r0] ; r1 = list length f2a sub r1,r1,#1 ; decrement so r1 = list length - 1 f3 ldr r0,=dlst ; point to list start f4 ldr r2,=0 ; init max val reg f5 ldr r4,=0 ; zero offset counter f8lp1 ldrb r3,[r0,r4] ; read list element f6 cmp r2,r3 ; comp against max val f8 bhi f8ct1 ; branch if r2> r3 f9 mov r2,r3 ; else new max val f8ct1 add r4,r4,#1 ; increment offset counter f10 cmp r4,r1 f11 bls f8lp1 ; loop for all list f12 ldr r0,=maxv f13 strb r2,[r0] ; save max val c4 ; c5 ; no infinite loop because c6 ; the emulator stops at end c7 ; c8 ; stop bal stop c9 ; lstl dcb 15 ; lstl - count offset 0 -> (lstl - 1) maxv dcb 0 dlst dcb 254,5,25,250,100,150,30,200,253,15, 23,46,73,175,0 ; end ; end directive to show nothing more in file

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)