Consider the following algorithm.
x ← 1
for
i is in {1, 2, 3, 4}
do
for
j is in {1, 2, 3}
do
x ← x + x
for
k is in {1, 2, 3, 4, 5, 6}
do
x ← x + 1
x ← x + 5
Count the number of + operations done by this algorithm.

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

not my style of question. haha

it looks like some type of for/next looping but the syntax is hard to parse

Its suppose to be discrete mathematics. I am not a math person at all.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.