That sucks for jack. But uhm what is your question. Also Jack can just put the popcorn in for a longer amount of time
Answer:
it's a(n)=a(n-1)+a(n-2)
this is also known as Fibonacci sequence
0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
Answer:
A
Step-by-step explanation:
