Josiah claims that the ordered pair (6,-10) can be replaced with any ordered pair and the set will still represent a function. Select all ordered pairs that could be used to show that this claim is incorrect

Complete Question:

{(–9, 1), (–5, 2), (0, 7), (1, 3), (6, –10)} Josiah claims that the ordered pair (6, –10) can be replaced with any ordered pair and the set will still represent a function. Select all ordered pairs that could be used to show that this claim is incorrect.

A. (–10, –10)

B. (–9, –6)

C. (–5, 1)

D. (1, 12)

E. (4, 7)

Step-by-step explanation:

A relation is represented as:

Where

For a relation to be a function, the domain must be unique and must not be repeated.

In the given function,

The domains are

So, if (6,-10) is to be replaced;

The domain of the ordered pair that will replace it must not be any of

From the list of given options:

The above can not replace (6,-10) because their domain exist already.

answer:   35 % is the probability of a late departure or an early arrival.

step-by-step explanation:

let l represents the late departure and e represents the early departure.

then, according to the question,

p(l) = 12 %,   p(e) = 27 % and = 4 %

and, we have to find out,

but, we know that,

which is the required equation that will use to find the probability of a late departure or an early departure.

therefore,   the probability of a late departure or an early arrival =   35 %