I NEED THIS IN RACKET PROGRAMMING IF IT IS NOT IN THAT I WILL DOWNVOTE AND REPORT YOUR ACCOUNT CHEGG AUTHORITY I WANT ANSWER WITH FULL EXPLANATION OTHERWISE I WILL REPORT IT

Define a procedure called make-graph which makes a graph with no nodes

; or edges and returns a graph object with local state as discussed in class. Use a

; dispatch or message-passing style as discussed in class. Write procedures called

; make-edge and make- node that return an edge and node respectively. Write

; procedures called add-node, add-edge that add nodes and edges to a graph

; respectively. Note, an edge can only be added if the corresponding nodes are

; already part of the graph. Write procedures called delete- node, delete-edge that

; delete nodes and edges from a graph respectively. When a node is deleted, all

; edges connected to the deleted node should automatically be removed. Finally,

; write a procedure print-graph