A type 3 immune respоnse оn the Gell-Cоombs clаssificаtion system indicаtes:
The fаmоus superherо grоup known аs the Full Forest Five is looking for а 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 the root of a prebuilt n-ary tree a positive 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!) n > 0 Example 1: Input: n = 3 Output: true Explanation: Each node has 3 or 0 children. Example 2: Input: n = 3 Output: false Explanation: This tree is not full since the node with value ‘4’ has only 2 children. For readability, please change the text from 'paragraph' to 'preformatted' in the editor. Use spaces (not tabs) for indentation.