Here are two text files, whose names are given by two string variables, file1 and file2. these text files have the same number of lines. write a sequence of statements that creates a new file whose name consists concatenating the names of the two text files (with a "-" in the middle) and whose contents of merging the lines of the two files. thus, in the new file, the first line is the first line from the first file, the second line is the first line from the second file. the third line in the new file is the second line in the first file and the fourth line is the second line from the second file, and so on. when finished, make sure that the data written to the new file has been flushed from its buffer and that any system resources used during the course of running your code have been released. (do not concern yourself with any possible exceptions here—assume they are handled elsewhere.)

When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?