Using C++solve the following: Given a binary tree in the multiple array representation format, you are asked to verify if the tree is a Red Black tree. Your code returns either 1 if it is indeed a RBTree or 0 if it is not. The binary tree is stored as a two dimensional array composed of 5 columns. The first column is the index, the 2nd column is the key, the 3rd column is the index of the left child, the 4th column is the index of the right child and the 5th column is the color (1 is black and 0 is red). This is very similar to the binary tree shown in slide 41 in set lec7. Assume that the root is the node at index 0 (first location in the Multiple-Array Representation).