Compute taxes in an imaginary world make it work for any size file now put at least 8 users in the file use 8 different combination of the rules send the output to another file create a neat chart with headings for each column using a formatted output compute taxes in an imaginary world. make it work for any size file. now, put at least 8 users in the file. use 8 different combinations of the rules. send the output to another file. create a neat chart with headings for each column using a formatted output. here are the wishful rules: 1-single 2-married < =$10,000 5% > $10,000 $300+10% of amount over $10,000 5600+11% of amount over $10,000 read from a file named "taxes. txt": users status (2 for married, 1 for single), year of birth (of oldest spouse if married), current year (ignoring month and day) annual income. if the person is married, call method married to compute and return the tax. otherwise call method if the age is at least 60, there is a reduction of 10% of the tax. this must be done in each of the above methods.

Imagine us is a startup that offers high definition 3d prenatal ultrasounds for high-end customers. the service process includes four activities that are conducted in the sequence described below. (the time required for each activity is shown in parentheses): activity 1: welcome a patient and explain the procedure. (20 minutes)activity 2: prep the patient (e.g., show them to the room, apply ultrasound gel). (17 minutes) (*your id number represents the amount of time needed to complete this task)activity 3: take images. (5 minutes)activity 4: discuss diagnostic with patient. (20 minutes)at each location there are employees (servers) s1, s2, and s3. the assignment of tasks to servers is the following: s1 does activities 1 and 2.s2 does activity 3.s3 does activity 4.a. what is the capacity of this process (in customers per hour)? b. suppose 3 patients arrive every hour on average. ignoring any “start of day” or “end of day” effects, what are the utilizations of all three servers (%)? c. suppose each activity can be done by any server and any server can do any set of activities. however, each activity is done by only one server. for example, a possible assignment includes: s1 does activity 1, s2 does activity 2, and s3 does activities 3 and 4. of course, the original assignment of servers to activities is also feasible. what is the maximum capacity of the process (in customers per hour)? d. now consider the capacity measures in (c) and (a), what is the percentage change? why can you improve capacity without using additional resources? (there is no free lunch, right? )note: for all hw assignments, show your process of getting the results. only providing the final answers is not acceptable and will get 0%. if necessary, use a separate sheet of paper to show your work.