You are tasked with creating a mileage calculator to calculate the amount of money that should be paid to employees. the mileage is computed as follows an amount of .25 for each mile up to 100 miles an amount of .15 for every mile above 100. so 115 miles would be (.25 * 100) + (.15 * 15) this can all be coded using a mathematical solution but i want you to use an if / else statement. here is how you are to implement it: if the total miles input is less than or equal to 100 then simply calculate the miles * .25 and output the amount otherwise compute the total amount for all miles mathematically. input: total number of miles process: dollar amount owed for miles driven output: amount of money due * note that you should simply do calculations within the if and else statements. this mean no cin or cout within if or else. do it afterward.

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk, thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\