In $[]$:

c$0=$ BTreeNodeBase$($keys$=[5,10],$ ptrs$=[],$ d$=2)$

c$1=$ BTreeNodeBase$($keys$=[18,42],$ d$=2)$

c$2=$ BTreeNodeBase$($keys$=[55,71],$ d$=2)$

c$3=$ BTreeNodeBase$($keys$=[99,182],$ d$=2)$

root $=$ BTreeNodeBase$($keys$=[12,49,81],$ ptrs$=[$c$0,$ c$1,$ c$2,$ c$3],$ is$\_$root$=$True, d$=2)$

root.fix$\_$parent$\_$pointers$\_$for$\_$children$()$

root.rep$\_$ok$()$

draw$\_$btree$\_$graph$($root$)$

Consider the example above. The list in ascending order will be $[5,10,12,18,42,49,55,71,81,99,182].$

In $[]$:

def get$\_$ascending$\_$sorted$\_$list$($root$)$:

your code here

raise NotImplementedError

In $[]$: c$0=$ BTreeNodeBase$($keys$=[5,10],$ ptrs$=[],$ d$=2)$

c$1=$ BTreeNodeBase$($keys$=[18,42],$ d$=2)$

c$2=$ BTreeNodeBase$($keys$=[55,71],$ d$=2)$

c$3=$ BTreeNodeBase$($keys$=[99,182],$ d$=2)$

root $=$ BTreeNodeBase$($keys$=[12,49,81],$ ptrs$=[$c$0,$ c$1,$ c$2,$ c$3],$ is$\_$root$=$True, d$=2)$

root.fix$\_$parent$\_$pointers$\_$for$\_$children$()$

root.rep ok$()$ Please implement where #your code here