Please answer both thank you

Consider this tree and from the statements below select those that are true. Note that the numbers in the circles are the keys. Node with key 22 is an acestor of node with key 27 Node with key 81 is a right child Node with key 53 is the left subtree of node with key 50 It is binary search tree It is a full (proper) binary tree Node with key 53 is a descendent of node with key 22 Node with key 81 is a leaf It is a complete binary tree Consider this Huffman Tree and select the statements that are true about it, the text from which it was generated, and the encoding it produces: V occurs with the lowest freeqency in the text The two least frequently occuring characters are encoded using exactly four bits V occurs more frequently than R but less frequently than M G and M occur with the same frequency but M is encoded using fewer bits than G 00011 is a valid string code for this tree 100100 encodes the string "22