Why is my js code not working the jsfiddle just won't respond. I also need help with the html for this code so that a user can enter a number so that the first queue starts from $2$ all the way to n $($the user's inputted number$)$ this will be known as Q$1.$ Then an empty queue needs to be created called Q$2$ so that the compueter can switch over the prime numbers from Q$1$ into Q$2.$ This is my js code: $//$Node classfor the list

class Node $\{$

constructor$($value$)\{$

this.value $=$ value;

this.next $=$ null;

$\}$

$\}$

$//$Queue class using a list

class Queue $\{$

constructor$()$

$\{$

this.head $=$ null;

this.tail $=$ null;

$\}$

$//$ Enqueue function using push

enqueue$($value$)\{$

let node $=$ new Node$($value$)$;

if $($this$.$head $===$ null$)\{$

this.head $=$ node;

this.tail $=$ node;

$\}$ else $\{$

this.tail.next $=$ node;

this.tail $=$ node;

$\}$

$\}$

$//$ Dequeuefunction using shift

dequeue

$()\{$

if $($this$.$head $===$ null$)\{$

return null;

$\}$ else $\{$

let node $=$ this.head;

this.head $=$ this.head.next;

if $($this$.$head $===$ null$)\{$

this.tail $=$ null;

$\}$

return node.value;

$\}$

$\}$

$//$ Peekfunction to get the front element

peek$()\{$

if $($this$.$head $===$ null$)\{$

return null;

$\}$ else $\{$

return this.head.value;

$\}$

$\}$

$//$IsEmptyfunction to checkif the queue is empty

isEmpty

$()$

$\{$

return this.head $===$ null;

$\}$

$//$ Print function to display the queue

$\}$

$//$ Sieve of Eratosthenes algorithm using two queues

function sieveOfEratosthenes$($n$)\{$

$//$ Create two queues

let Q$1=$ new Queue$()$;

let Q$2=$ new Queue$()$;

$//$ Fill Q$1$ with numbers from $2$ to n

for $($let i $=2$; i $<=$ n; i$++)\{$

Q$1.$enqueue$($i$)$;

$\}$

$//$ Initialize the iteration number

let iteration $=0$;

$//$ Loop until Q$1$ is empty

while $(!$Q$1.$isEmpty$())\{$

$//$ Dequeue the first element of Q$1$ and call it X

let X $=$ Q$1.$dequeue$()$;

$//$ Enqueue X to Q$2$

Q$2.$enqueue$($X$)$;

$//$ Iterate over the remaining elements of Q$1$

while $(!$Q$1.$isEmpty$())\{$

$//$ Dequeue the next element of Q$1$ and call it Y

let Y $=$ Q$1.$dequeue$()$;

$//$ Check if Y is divisible by X

if $($Y $\%$ X $!==0)\{$

$//$ If not, enqueue Y back to Q$1$

Q$1.$enqueue$($Y$)$;

$\}$

$\}$

$//$ Increment the iteration number

iteration$++$;

$//$ Print the values of Q$1$ and Q$2$

console.log$(`$Iteration $$\{$iteration$\}$: Q$1=$ $$\{$Q$1.$print$()\}$ Q$2=$ $$\{$Q$2.$print$()\}`)$;

$\}$

$\}$

$//$ Test the code with n $=10$

sieveOfEratosthenes$(10)$;