Find the overhead fraction for a full K $-$ary tree implementation with space

requirements as follows:

$($a$)$ All nodes store data, K child pointers, and a parent pointer. The data

$$eld requires four bytes and each pointer requires four bytes.

$($b$)$ All nodes store data and K child pointers. The data $$eld requires six$-$

teen bytes and each pointer requires four bytes.

$($c$)$ All nodes store data and a parent pointer, and internal nodes store K

child pointers. The data $$eld requires eight bytes and each pointer re$-$

quires four bytes.

$($d$)$ Only leaf nodes store data; only internal nodes store K child pointers.

The data $$eld requires four bytes and each pointer requires two bytes.

Especially what portion do i have to give for internal node and leaf node, for binary tree it's just $1$:$1.$ I guess in full tree the portion would be n: $($k$-1)$n$+1$ roughly $1$:k$-1.$