Assuming that data mining techniques are to be used in the following cases, identify whether the task required is supervised or unsupervised learning. a. deciding whether to issue a loan to an applicant based on demographic and financial data (with reference to a database of similar data on prior customers). b. in an online bookstore, making recommendations to customers concerning addi- tional items to buy based on the buying patterns in prior transactions. c. identifying a network data packet as dangerous (virus, hacker attack) based on com- parison to other packets whose threat status is known. d. identifying segments of similar customers. e. predicting whether a company will go bankrupt based on comparing its financial data to those of similar bankrupt and nonbankrupt firms. f. estimating the repair time required for an aircraft based on a trouble ticket. g. automated sorting of mail by zip code scanning. h. printing of custom discount coupons at the conclusion of a grocery store checkout based on what you just bought and what others have bought previously.

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