Answer:
The probability is 
Step-by-step explanation:
If she has n distinct password candidates and only one of which will successfully log her into a secure system, the probability that her first first successful login will be on her k-th try is:
If k=1

Because, in her first try she has n possibles options and just one give her a successful login.
If k=2

Because, in her first try she has n possibles options and n-1 that are not correct, then, she has n-1 possibles options and 1 of that give her a successful login.
If k=3

Because, in her first try she has n possibles options and n-1 that are not correct, then, she has n-1 possibles options and n-2 that are not correct and after that, she has n-2 possibles options and 1 give her a successful login.
Finally, no matter what is the value of k, the probability that her first successful login will be (exactly) on her k-th try is 1/n
Answer:
Domain → 0 < x < 5
Step-by-step explanation:
Sasha sells T-shirts and earns a fixed amount plus a commission by selling each shirt. (As given in the table)
Table attached shows a linear function (A regular increase in total pay with the increase in number of shirts sold)
So the input values of the table (Number of shirts sold) will represent the domain of the linear function.
Hence, reasonable domain for the function will be → 0 < x < 5
The picture isn’t clear enough