Answer:
Step-by-step explanation:

divide both sides by 32000

take the ln of both sides

using the property that


divide both sides by ln(0.8)

use calculator
7.00728=t
so in about 7 years
B
Answer:
1-2y+y^2
Step-by-step explanation:
(1–y)^2
(1-y) * (1-y)
FOIL
first: 1*1 =1
outer: 1*-y = -y
inner: -y *1 = -y
last: -y*-y = y^2
Add together: 1+-y-y+y^2
1-2y+y^2
A LR parser is called a shift-reduce algorithm, because in most cases it either shifts the next lexeme of input onto the parse stack or reduces the handle that is on top of the stack.
<u>Explanation:</u>
A parser is that aspect of the compiler which practices a token string as input and with the sustenance of enduring grammar, transforms it into the identical parse tree. The LR parser is a non-recursive, shift-reduce, bottom-up parser. It utilizes a broad range of context-free grammar which gives it the most valuable syntax analysis procedure.
LR means that the data is examined left-to-right and that a rightmost source, in reverse, is assembled. LR parsers relish time and space extended in the size of the input. Practically all programming languages possess LR grammars.