Answer:
b
Step-by-step explanation:
A=½bh
2A=bh
b=2A/h
That is the final Answer.
Hope that can help you !
I hope u understand the solution.
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
y-3=3(x+1)
opening the bracket
y-3=3x+3
y=3x+3+3
equation of the line in the form y=mx+c;
y=3x+6
therefore gradient=3
parallel lines have same gradient therefore gradient of the other line is 3
y--3/x-0=3
y+3=3(x-0)
y+3=3x-0
y=3x-3.
Step-by-step explanation:
<em>I</em><em> </em><em>didn't</em><em> </em><em>understand</em><em> </em><em>a thing</em><em> </em><em>.</em><em>.</em><em>.</em><em>.</em><em>.</em>