9514 1404 393
Answer:
(b) 8
Step-by-step explanation:
We assume that a path must not repeat any node. (So, loops at G are forbidden.)
There are 2 paths through B to A.
There are 2 paths through D to A, so a total of 4 ways to get from C to A.
There is one path from A to H.
There are two paths from H to F, and one path from F to E.
The total number of possible paths is (4)(1)(2)(1) = 8.
Here is a list.
CBAHFE, CDBAHFE, CBAHGFE, CDBAHGFE,
CDAHFE, CBDAHFE, CDAHGFE, CBDAHGFE
69 - 3a = 0
69 - 3a (-69) = 0 (-69)
-3a = -69
-3a(/-3) = -69(/-3)
a = 23
hope this helps
<span><span>3/4</span>+<span>7/12</span></span>−<span>(<span>−4</span><span>)
</span></span>4/3−<span>(−4)
Answer:
</span><span>16/<span>3
I hope this helps!</span></span>
Answer:
x=1+2i/2
Step-by-step explanation:
Using the method of completing the square
(2x)²-2(2x)1 +(1)²+4=0
(2x-1)²=-4
taking square root on both sides
2x-1=2i
2x=1+2i
x=1+2i/2
I honestly believe its D but I'm not for sure. Sorry if i didn't help much