Make the following modifications to your Maclaurin series expansion code from HW 1: • Make the specified answer tolerance (εs) an input to the function • Calculate the approximate percent relative error (εa) inside the loop instead of the true percent relative error • terminate when εa falls below εs. Test your code by approximating ln(0.6). Use a specified answer tolerance corresponding to 4 significant digits. What is the true percent relative error of your result? How does this compare to the final approximate percent relative error?

Write a method replacekey in the minheap class with the following signature: public void replacekey(integer oldkey, integer newkey) the method will replace the first occurrence of oldkey with the newkey, and restore the min-heap property after the change. if the oldkey does not exist in the heap, the method prints an appropriate message and returns without changing the heap. example: suppose our binary heap object (bh) has the following keys: *** 4 6 7 32 19 64 26 99 42 54 28 then the method call: bh. replacekey (oldkey integer(54), newkey integer(2))

Write a function named printfloatrepresentation(float number) that will print the floating point representation of a number using the format given below. (sign bit) exponent in binary (assumed bit).significandfor example if the number passed an argument is 71 yourprogram should print (0) 10000101 (1).00011100000000000000000similarl y if the number passed to the function as argument is -71 the program should print (1) 10000101 (1).00011100000000000000000

Why should you evaluate trends when thinking about a career path?