Write an armv8 assembly function to compute the sum of geometric sequence of the first n terms using recursion. assume the user inputs a (first term), r (common ratio), and n is a 64-bit non-zero positive integer stored in x1, x2, and x3 respectively. assume all the registers are used by the caller except the registers used for passing the parameters to and from the function. the sum is stored in x0. assemble, test, and simulate the assembly code using ds-5 simulator. do not upload the entire ds-5 project. only upload the assembly file (.s file) from the ds-5 project to canvas. comment your assembly code. (35 points)

Given a link with a maximum transmission rate of 32.8 mbps. only two computers, x and y, wish to transmit starting at time t = 0 seconds. computer x sends filex (4 mib) and computer y sends filey (244 kib), both starting at time t = 0. statistical multiplexing is used, with details as follows packet payload size = 1000 bytes packet header size = 24 bytes (overhead) ignore processing and queueing delays assume partial packets (packets consisting of less than 1000 bytes of data) are padded so that they are the same size as full packets. assume continuous alternating-packet transmission. computer x gets the transmission medium first. at what time (t = ? ) would filey finish transmitting? give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes)