Answer:
In your console (ctrl + shift + j), the letter a would appear. Beneath that, the letter c would appear.
Step-by-step explanation:
This is because the val2 is not less than or equal to 3. The second condition that's inside the first condition is true but since the first condition is false, the second condition would not run.
Answer:
Step-by-step explanation:
I don’t know why they bother teaching recursive formulas as the explicit is almost always used :)
For 2,9,16,23...
Recursive is a(n+1)=an+7
Explicit is an=2+7(n-1)
(or more neatly an=7n-5)
For 2,14,98,686...
Recursive is a(n+1)=7an
Explicit is an=2(7^(n-1))
(or (2/7)7^n )
Answer:
Option A) 
Step-by-step explanation:
The given expression is:
Taking LCM in upper and lower fractions, we get:
Therefore, the option A gives the correct answer.
Watch yt bro there’s all the answer
