Acertain computer algorithm executes twice as many operations when it is run with an input of size k as when it is run with an input of size k − 1 (where k is an integer that is greater than 1). when the algorithm is run with an input of size 1, it executes seven operations. how many operations does it execute when it is run with an input of size 24?

Step-by-step explanation:

eftry8uogw3h5y76tqth3ygahdt209W378484RW0444444404040404040404442034723847923874984R32F6879F4R3687979F4R396U87F34R86779H9HW5F8T9H67H6757WF3TWFT8TH75GF389HT75F2F8H97TF559H8H8T67522FF8TH627O5O5H

logv3(x+2)=1

rewrite in exponential form:

logb(x) = y is equal to b^y =x

b = 3, y = 1

now solve for x:

3^1 = x+2)

x = 3-2

x = 1

see the picture for the graph.

step-by-step explanation: