Given the python code below, find the output of the "print$\_$graph" function for the following graph:

# implementation of an undirected graph using Adjacency Matrix, with weighted or unweighted edges

# its definitely work

class Vertex:

def $\_\_$init$\_\_($self$,$ n$)$:

self.name $=$ n

class Graph:

vertices $=\{\}$

edges $=[]$

edge$\_$indices $=\{\}$

def add$\_$vertex$($self$,$ vertex$)$:

if isinstance$($vertex$,$ Vertex$)$ and vertex.name not in self.vertices:

self.vertices$[$vertex$.$name$]=$ vertex

for row in self.edges:

row.append$(0)$

self.edges.append$([0]*($len$($self$.$edges$)+1))$

self.edge$\_$indices$[$vertex$.$name$]=$ len$($self$.$edge$\_$indices$)$

return True

else:

return False

def add$\_$edge$($self$,$ u$,$ v$,$ weight$=1)$:

if u in self.vertices and v in self.vertices:

self.edges$[$self$.$edge$\_$indices$[$u$]][$self$.$edge$\_$indices$[$v$]]=$ weight

self.edges$[$self$.$edge$\_$indices$[$v$]][$self$.$edge$\_$indices$[$u$]]=$ weight

return True

else:

return False

def print$\_$graph$($self$)$:

for v$,$ i in sorted$($self$.$edge$\_$indices.items$())$:

print$($v $+\text{'}\text{'},$ end$=\text{'}\text{'})$

for j in range$($len$($self$.$edges$))$:

print$($self$.$edges$[$i$][$j$],$ end$=\text{'}\text{'})$

print$(\text{'}\text{'})$

g $=$ Graph$()$

# print$($str$($len$($g$.$vertices$)))$

a $=$ Vertex$(\text{'}$A$\text{'})$

g$.$add$\_$vertex$($a$)$

g$.$add$\_$vertex$($Vertex$(\text{'}$B$\text{'}))$

for i in range$($ord$(\text{'}$A$\text{'}),$ ord$(\text{'}$K$\text{'}))$:

g$.$add$\_$vertex$($Vertex$($chr$($i$)))$

edges $=[\text{'}$AB$\text{'},\text{'}$AE$\text{'},\text{'}$BF$\text{'},\text{'}$CG$\text{'},\text{'}$DE$\text{'},\text{'}$DH$\text{'},\text{'}$EH$\text{'},\text{'}$FG$\text{'},\text{'}$FI$\text{'},\text{'}$FJ$\text{'},\text{'}$GJ$\text{'},\text{'}$HI$\text{'}]$

for edge in edges:

g$.$add$\_$edge$($edge$[$:$1],$ edge$[1$:$])$

g$.$print$\_$graph$()$Graph