A B$+$ tree has $N=4$ and $L=4.$ It's height is $3($Level $0,1,2).$ What is the maximum number of unique keys that it can hold? $($Assumption: We have inserted unique keys into this tree$)$

$N=$ maximum children a node can have

$L=$ maximum keys a node can have