2. + -11 points epp discmath5 6.3.024. let a = {t, u, v, w}, and let s, be the set of all subsets of a that do not contain w, and s, the set of all subsets of a that contain w. (a) find s. (enter your answer in roster notation. enter empty or for the empty set.) (b) find s, (enter your answer in roster notation. enter empty or o for the empty set.) (c) are s, and s, disjoint? yes o no (d) compare the sizes of s1 and 52: sy has elements, sz has elements, therefore the size of s the size of s2 -- is greater than is less than is equal to (e) how many elements are in s, usz? (f) what is the relation between su s2 and p(a)? os, u sy is not a subset of p(a) p(a) is not a subset of s, us2 o su s2 is a proper subset of p(a) op(a) is a proper subset of sus2 su s2 is equal to p(a)

4th option is correct xy=-10

if this was to u plzz mark me the brainliest

the system of inequity is

step-by-step explanation:

from the given graph it is noticed that we have two related lines. one is solid and another is dashed.

if a line passing through two points, then the equation of line is

the solid line passing through the points (0,4) and (4,0).

the related equation of solid line is .

similarly, find the related equation of dashed line. the dashed liune passing through the points (0,0) and (3,1).

the related equation of dashed line is

from the given graph it is noticed that the point (0,1) lies on the shaded region, therefore the point (0,1) must be satisfied by the related equations.

check the related equations by the point (0,1).

this statement is true if the sign of inequality is < instead of equality. since it is an solid line therefore the sign of inequality will be . the required inequality is

similarly, check the second related equation.

it is a dashed line, so this statement is true if the sign of inequality is > . the required inequality is

sample answer: you can determine whether each element of the domain is paired with exactly one element of the range. for example, if given a graph, you could use the vertical line test; if a vertical line intersects the graph more than once, then the relation that the graph represents is not a function.