For the same tree as the previous question. Assume that it is a binary tree and stored in an array. Also assume that we have the root node at index 0 . Q2.1 0.5 Points What is the index of node B? Answer = Q2.2 0.5 Points What is the index of node C ? Answer = Q2.3 0.5 Points What is the index of node D? Answer = What is the index of node E ? Answer = Q2.5 1 Point For a node stored at index i, if it has a right child node, what would be the index of that node? 2i2i+12(i+1) none of above