Hello…I need help with my calculus problem. see attachment for details.

2. Jason and Mary Kate are having a bike race to see who can bilre the furthest in a set amount oftime. Let fit] and fit} give the velocity of Jason and Mary Kate respectively, in miles per hour, thours after the start of the race. Assume the race lasts for 1.5 hours. A table with some vaiues offit] and a formula for 9:3} are given below. Assume that fit} is increasing for [l -: t -=: {1.5 anddecreasing for [LB «1’. t a: 1.5, and notice that git] is increasing for [I «c: t a: 1.5. mammal-mm IIiI-Iifi-mlm gm = ritet (a) Write a left—hand Riemann sum with as many snbintervals as pomible for the distance traveledby Jason over the course of the race, and evaluate this Riemann sum. (The snhintervals in theRiemann sum do not have to have the same length.) Eb} Write a Riemann sum with as many snbintervals as possible that gives an UNDERESTIMATE forthe distance traveled by Jason over the course of the race, and evaluate this Riemann sum.Sketch a graph that illustrate. why your Riemann sum is an underestimate. (The snbintervalsin the Riemann sum do not have to have the same length.) (c) Write a Riemann sum with E: subintervals of the same length that gives an UNDEREETIMATE for the distance traveled by Mary Kate over the course of the race, and evaluate this Riemannsum. Sketch a graph that illustrates why your Riemann sum is an underestimate. Ed} Write a right—hand Riemann sum with 5 suhintervals of the same length that gives the distance traveled by Mary Kate over the course of the race, and evaluate this Riemann sum. Sketch agraph that illustrates your Riemann sum. (e) Is it possible to tell solely from the estimated distances in the previous parts who traveledfurther? If so, determine who If not, explain why not. {f} Suppose Mary Kate wants to use a Riemann sum to calculate how far she traveled fori] <’.’. t a: 1.5, accurate to within {1.1 miles. How many times would she have to measure hervelocity in order to achieve this accuracy?

Hi, I have some question with System Modelling and Design. Can someone me? best to have a handwriting answer.

Four wifi networks, Alpha, Bravo, Charlie and Delta, all exist within close proximity to one another as shownbelow. Networks connected with an edge in the diagram above can interfere with each other. To avoid interferencenetworks can operate on one of two channels, hi and lo. Networks operating on different channels will notinterfere; and neither will networks that are not connected with an edge. Our goal is to determine (algoriti’lmically) whether there is an assignment of channels to networks sothat there is no interference To do this we will transform the problem into a problem of determining if apropositional formula can be satisfied. (a) Carefully defining the propositional variables you are using, write propositional formulas for each ofthe following requirements:(i) an: Alpha uses channel hi or channel lo; and so does Bravo, Chariie and Delta.(ii) gag: Alpha does not use both channel hi and lo; and the same for Bravo, Charlie and Delta.(iii) o3: Alpha and Bravo do not use the same channel; and the same applies for all other pairs ofnetworks connected with an edge.(b) (i) Show that an A or; A (333 is satisfiable; so the requirements can all be met. Note that it is sufficientto give a satisfying truth assignment, you do not have to list all possible combinations. (ii) Based on your answer to the previous question, which channels should each network use in orderto avoid interference? ‘