$.$orig x$3000$

;; You do not need to write anything here

LD R$6,$ STACK$\_$PTR

;; Pushes arguments $($address of node $1,$ target node $5)$

ADD R$6,$ R$6,-1$

AND R$1,$ R$1,0$

ADD R$1,$ R$1,5$

STR R$1,$ R$6,0$

ADD R$6,$ R$6,-1$

LD R$1,$ STARTING$\_$NODE$\_$ADDRESS

STR R$1,$ R$6,0$

JSR DFS

LDR R$0,$ R$6,0$

ADD R$6,$ R$6,3$

HALT

STACK$\_$PTR $.$fill xF$000$

STARTING$\_$NODE$\_$ADDRESS $.$fill x$6110$

VISITED$\_$VECTOR$\_$ADDR $.$fill x$4199$ ;; stores the address of the visited vector.

;; SET$\_$VISITED Pseudocode

;; Parameter: The address of the node

;; Updates the visited vector to mark the given node as visited

;; SET$\_$VISITED$($addr node$)\{$

;; visited $=$ mem$[$mem$[$VISITED$\_$VECTOR$\_$ADDR$]]$;

;; data $=$ mem$[$node$]$;

;; mask $=1$;

;; while $($data $>0)\{$

;; mask $=$ mask $+$ mask;

;; data$--$;

;; $\}$

;; mem$[$mem$[$VISITED$\_$VECTOR$\_$ADDR$]]=($visited $|$ mask$)$; $//$Hint: Use DeMorgan's Law!

;; $\}$

SET$\_$VISITED ;; Do not change this label! Treat this as like the name of the function in a function header

;; Code your implementation for the SET$\_$VISITED subroutine here!

RET

;; IS$\_$VISITED Pseudocode

;; Parameter: The address of the node

;; Returns: $1$ if the node has been visited, $0$ if it has not been visited

;; IS$\_$VISITED$($addr node$)\{$

;; visited $=$ mem$[$mem$[$VISITED$\_$VECTOR$\_$ADDR$]]$;

;; data $=$ mem$[$node$]$;

;; mask $=1$;

;; while $($data $>0)\{$

;; mask $=$ mask $+$ mask;

;; data$--$;

;; $\}$

;; return $($visited & mask$)!=0$;

;; $\}$

IS$\_$VISITED ;; Do not change this label! Treat this as like the name of the function in a function header

;; Code your implementation for the IS$\_$VISITED subroutine here!

RET

;; DFS Pseudocode $($see PDF for explanation and examples$)$

;; Parameters: The address of the starting $($or current$)$ node, the data of the target node

;; Returns: the address of the node $($if the node is found$),0$ if the node is not found

;; DFS$($addr node, int target$)\{$

;; SET$\_$VISITED$($node$)$;

;; if $($mem$[$node$]==$ target$)\{$

;; return node;

;; $\}$

;; result $=0$;

;; for $($i $=$ node $+1$; mem$[$i$]!=0$ && result $==0$; i$++)\{$

;; if $(!$ IS$\_$VISITED$($mem$[$i$]))\{$

;; result $=$ DFS$($mem$[$i$],$ target$)$;

;; $\}$

;; $\}$

;; return result;

;; $\}$

DFS ;; Do not change this label! Treat this as like the name of the function in a function header

;; Code your implementation for the DFS subroutine here!

RET

$.$end

;; Assuming the graphs starting node $(1)$ is at address x$6100,$ here's how the graph $($see below and in the PDF$)$ is represented in memory

;;

;; $03$

;; $\backslash /|\backslash$

;; $41-2$

;; $\backslash /|$

;; $5-6$

;;

$.$orig x$4199$

$.$fill $0$ ;; visited set will be at address x$4199,$ initialized to $0$

$.$end

$.$orig x$6110$ ;; node $1$ itself lives here at x$6110$

$.$fill $1$ ;; node.data $(1)$

$.$fill x$6120$ ;; node $2$ lives at this address

$.$fill x$6130$ ;; node $3$ lives at this address

$.$fill x$6150$ ;; node $5$ lives at this address

$.$fill $0$

$.$end

$.$orig x$6120$ ;; node $2$ itself lives here at x$6120$

$.$fill $2$ ;; node.data $(2)$

$.$fill x$6110$ ;; node $1$ lives at this address

$.$fill x$6130$ ;; node $3$ lives at this address

$.$fill x$6160$ ;; node $6$ lives at this address

$.$fill $0$

$.$end

$.$orig x$6130$ ;; node $3$ itself lives here at x$6130$

$.$fill $3$ ;; node.data $(3)$

$.$fill x$6110$ ;; node $1$ lives at this address

$.$fill x$6120$ ;; node $2$ lives at this address

$.$fill x$6140$ ;; node $4$ lives at this address

$.$fill $0$

$.$end

$.$orig x$6140$ ;; node $4$ itself lives here at x$6140$

$.$fill $4$ ;; node.data $(4)$

$.$fill x$6100$ ;; node $0$ lives at this address

$.$fill x$6130$ ;; node $3$ lives at this address

$.$fill x$6150$ ;; node $5$ lives at this address

$.$fill $0$

$.$end

$.$orig x$6100$ ;; node $0$ itself lives here at x$6000$

$.$fill $0$ ;; node.data $(0)$

$.$fill x$6140$ ;; node $4$ lives at this address

$.$fill $0$

$.$end

$.$orig x$6150$ ;; node $5$ itself lives here at x$6150$

$.$fill $5$ ;; node.data $(5)$

$.$fill x$6110$ ;; node $1$ lives at this address

$.$fill x$6140$ ;; node $4$ lives at this address

$.$fill x$6160$ ;; node $6$ lives at this address

$.$fill $0$

$.$end

$.$orig x$6160$ ;; node $6$ itself lives here at x$6160$

$.$fill $6$ ;; node.data $(6)$

$.$fill x$6120$ ;; node $2$ lives at this address

$.$fill x$6150$ ;; node $5$ lives at this address

$.$fill $0$

$.$end

How would I implement this in LC$-3$