Complete the getRegEx() function which returns a regular expression string to match any linear equations or inequations, such as the ones below. You may have any number of terms on the left hand side or the right hand side of the equation. You need to return a regular expression string such that when compiled, the .findall() method will parse the entire equation/inequation. Eg The equation: will parse into the list of tuples: It is worth noting that any of the linear equations/inequations can be parsed into separate groups with the parts the sign the coefficient, the variable, the equality/inequality symbol any of which may or may not be present. The first test cell will test against the above equations while the second test cell will test against some similar randomly generated equations In [ ]: import re def getRegEx) regex" # YOUR CODE HERE return regex In [ ]: # Test cell 1: test against the above equations (1 point) equation-1= '3x<=6+2y+7z. pattern getRegEx() result = re. findall(pattern, equation-1) assert result['3', 'x', '<, (,6','", '"), (+', '2", 'y. ''), (+', '7', 'z', ), "The equation is print("Passed!")

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