T is a rooted tree in which every node has either 3 children or is a leaf. The height of T is k, k>0, where the height is the length of the longest path from root r to a leaf node. The minimum number of nodes a tree T of height k can have is

a) 3k + 1

b) k + 1

c) 3k

d) 6k