I need help making the html for this javascript queue that is a augemented list $($Not An Array$).$ You will fill the first list with numbers consecutively numbered from $2$ to n$,$ where n is entered by the user $($we will call this Q$1.$ Here is the algorithm;

Dequeue $1$st element in Q$1($which will be $2).$ You will need to remember the value of this element $$ we will call it X$.$

Enqueue this element into Q$2($Q$2$ is the list of primes$)$

Iterate and Dequeue each successive element of Q$1$

If the value is divisible by X$,$ go to the next element

if the value is not divisible by X enqueue back onto Q$1,$ and go to the next element.

Print the values of Q$1$ and Q$2$ after each time through.

When done go back to the beginning of the Q$1$ and repeat steps $1-3($the first value will be $3$ the second time around$)$

Sample output with input $10$

Iteration $0$: Q$1=2345678910,$ Q$2=,$Iteration $1$: Q$1=3579,$ Q$2=2,$ Iteration $2$: Q$1=57,$ Q$2=23$ Iteration $3$: Q$1=7,$ Q$2=235$ Iteration $4$: Q$1=,$ Q$2=2357$ This is the code so far: $//$ Node class for 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;

$\}$

$\}$

$//$ Dequeue function 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;

$\}$

$\}$

$//$ Peek function to get the front element

peek $()\{$

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

return null;

$\}$ else $\{$

return this.head.value;

$\}$

$\}$

$//$ IsEmpty function to check if the queue is empty

isEmpty $()\{$

return this.head $===$ null;

$\}$

$//$ Print function to display the queue

print $()\{$

let node $=$ this.head;

let result $=""$;

while $($node $!==$ null$)\{$

result $+=$ node.value $+""$;

node $=$ node.next;

$\}$

console.log $($result$)$;

$\}$

$\}$

$//$ 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 $()$;

console.log $("$Q$2=")$;

Q$2.$print $()$;

$\}$

$\}$