Fibonacci procedure in Java, sequencing - sequence

Question

I am currently trying to figure out this question right now in regards to a Fibonacci sequence. It is fairly straight forward but I don't know what i can't get it. Apologize beforehand for my incompetence.
My current code, I know it's completely wrong, it doesn't even compile.. I'm so lost can someone please explain it to me
public static void fib(int n)
{
int neW = 1;
int next = 1;
int old = neW - next;
while (neW <= n)
{
neW = next + old;
old = next;
next = neW;
System.out.println(neW);
}
}
My current code output compared to the correct one;

Answer 1

there's a couple of things about your code that confuse me, but this is how I would do it:
public static void fib(int n)
{
int current = 0;
int old = 1;
int new = 0;
for(int i = 0; i < n; i = i+1)
{
new = current + old;
old = current;
current = new;
System.out.println(current);
}
}

Answer 2

On further investigation into your screenshot it seems like calling the function fib(n) should return n number of values and not up to that value. We don't tend to write code when we know it's an assignment however it seems that you missed a bit with the question and your code almost checks out... So here's my theory of a solution, but I cannot guarantee that it works.
public static void fib(int b)
{
int n = 0;
int neW = 1;
int next = 1;
int old = neW - next;
while (n <= b)
{
System.out.println(neW);
neW = next + old;
old = next;
next = neW;
n++;
}
}
Something like that should do the trick.