For the tree structure, we define the height of the root node as $1.(20\%)$

$(1)$ The minimum number of nodes in a minimum binary heap of height $n$ is $2^i+j.$ What is the value of $i+j=?(5\%)$

$(2)$ What is the maximum number of keys in a B$-$tree of order $6$ and height $4?(5\%)$