D Question 21 8 pts The famous superhero group known as the Full Forest Five is looking for a new member after the heroic sacrifice of Arndrew to save Robean from a terrible wildfire. The leader, Prof. Anam, wants to speed up the tryout process, and he needs your help! Only full n-ary trees are allowed into the Full Forest Five. A full n-ary tree is a tree where each node has either 0 children or exactly n children. Write a function in pseudocode or C++ that can determine if a given n-ary tree is full. You are given 1. the root of a prebuilt n-ary tree 2. an integer n that states the maximum number of children a node can have Return a boolean indicating if the tree is full or not. Your function should have the signature bool isFull(Node* root, int n). You may create any helper functions if needed. The following Node struct is given: struct Node { int val; vector children; Node (int x) : val(x), children({}) {} Constraints: root could be null (this is a full tree!)