Given the algorithm procedure la (ai, a2, ...,&n integers)
IN
t: = 0
fori:= 2 to n
if (a, > m) then
mea,
t: st+1
If the input is the list
[1, 6, 2, 3. 7. 7, 4, 8, 8, 6]
how many additions are used?

tigers

step-by-step explanation:

cougars 12/10 (12-10 = 2)

bobcats 20/10 (20-10 =10)

bulldogs 8/5 (8-5 =3)

tigers 3/5 (3-5 =-2)

triangle abc is reflected on the line x=-6.5 then reflected again on the x axis

step-by-step explanation:

b mark me branliest thx

step-by-step explanation: