A min-Heap can be visualized as a binary tree of height with each node having at most two children with the property that value of a node is at most the value of its children. Such heap containing n elements can be represented (stored) as an array with the property

Suppose that you would like to construct a l min Heap: each node has at most l children and the value of a node is at most the value of its children.

(a) How do you represent L min heap as an array? Write the property of the array.

(b) What is the height of the L heap (when visualized as a tree) consisting of n elements in terms of L and n? Assume that the height of a heap-tree with just 1 element is 1.

(c) Describe an algorithm to remove the smallest element from an L heap containing n elements. What is the asymptotic run time of the your algorithm (in terms of n and L).