If a recursive rule of a sequence is f(1)=12, f(n)=f(n-1)+3 for n>_2, write its explicit rule

i’m sorry but i don’t know sorry

you are playing an adventure game on your computer. you come across a troll who won't let you pass and there is no other way to get to the other side of the river except over the bridge he is guarding.

the troll is a nerd. he takes great delight in watching people struggle with his problems. very few get them. he only gives you one chance and then he changes the puzzle. you have to solve this one.

before you are four blocks. they are numbered 11,6, -7,21.

he tells that the answer he wants is minus and between -1 and - 2. you can use +, -, ×, ÷   ( and ) as many times as you like or no times at all. you don't like the way he's looking at you, but you need to cross the bridge. what do you do?