Assume that A and B share a long-term 256-bit AES keyK. Our key exchange protocol has twogoals: (1) let A and B agree on a new fresh session keyKsto be used for a current session, and (2)perform mutual authentication. Nb is a nonce andKsis a new session key generated by B. AssumethatKsandNbare of the same bit-length and both are always chosen at random. EK(.) denotesAES encryption of everything inside () with keyK. HM ACK(.) denotes SHA2-based HMAC ofeverything inside () using keyK Required:
What (if any) are the vulnerabilities of this protocol?

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.)

Aline ab is in 1st quadrant , its ends a and b respectively are 20mm and 60mm infront of vp respectively . the distance between the end projectors is 75 mm . the line is inclined at 30 degrees to the hp and end a 20 degrees above the hp . draw its projections , find true length

Which of the following if statements uses a boolean condition to test: "if the item is on sale, you can buy it"? a: if( onsale < = "yes" ): b: if( onsale > = "yes" ): c: if( onsale == "yes" ): d: if( onsale ! = "yes" ):