You're enjoying learning programming so much, you've decided to run your own class teaching programming basics. You've got plenty of students signing up, and now you need to make logins for each of them. Since usernames (but not first names) have to be unique, you decide to write a program to help generate them. You should read in the classlist. txt which contains on each line. Your program should print out a list of usernames based on the following rules:

Username should be a students' first and, if applicable, middle name(s), with no spaces, converted to lower case.
If there already exists a student with that username, use their firstname plus first letter of last name converted to lower case.
If that already exists, use firstname plus first letter of lastname, plus a number, starting at 1 and counting up as required.

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?