This is a quick and easy program that will let you practice the basics of the switch statement. You will ask the user to enter a fabric code found on a pair of pants. The fabric code is in the form of . Read the code and then inform the user what material the pants are made out of. Valid user entries are: - 'C' for Cotton - 'L' for Liner - 'P' for Polyester The number is the thread count of the material and must be between 100 and 1000 inclusive. If either the code or the count is invalid print the indicated invalid statement. Prompt: Enter the fabric code found on your pants: Possible Output: Your pants contain cotton with a thread count of 300. Air dry to avoid shrinking! Your pants contain linen with a thread count of 400. They are cool but wrinkle easily! Your pants contain polyester with a thread count of 1000. They are stain resistant! Invalid fabric code. Please run the program again. Notes and Hints: 1) You must use a Switch statement for this 2) You must accept the upper or lowercase version of the letters 3) This is not a trivial excercise, Hand write the algorithm BEFORE you start coding!!

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.\