Implement the sieve of Eratosthenes as a Go program: a method for computing prime numbers, known to the ancient Greeks.

This method will compute all prime numbers up to n$.$

Choose an n $($i$.$e$.,$ via user input$).$

First insert all numbers from $2$ to n into a set.

Then erase all multiples of $2($except $2)$; that is$,4,6,8,10,12$ package main

import $($

$"$fmt$"$

$)$

func main$()\{$

var n int

fmt$.$Print$("$Enter a positive integer: $")$

fmt$.$Scan$($&n$)$

set :$=[]$int$\{\}$

Divide$2$ :$=[]$int$\{\}$

for i :$=2$; i $<=$ n; i$++\{$

set $=$ append$($set$,$ i$)$

$\}$

for $\_,$ num :$=$ range set $\{$

if isPrime$($num$,$ len$($set$))\{$

Divide$2=$ append$($Divide$2,$ num$)$

$\}$

$\}$

fmt$.$Println$("$Prime numbers up to$",$ n$,$ "are:", Divide$2)$

$\}$

func isPrime$($n int, size int$)$ bool $\{$

if n $<2\{$

return false

$\}$

for i :$=2$; i$*$i $<$ size; i$++\{$

if n$\%$i $!=0\{$

return true

$\}$

$\}$

return false

$\}$

Go up to $$n$.$

Fix the code for GO