Consider the following graph. Choose the most appropriate answer/answers based on whether such a graph exists or does not exist, which are based on the Graph Theoretic Properties as discussed in Chapter 10. A Binary Tree with height 4 and 19 terminal vertices. The maximum number of terminal vertices for such a Binary Tree with height 4 is 16. The total maximum number of edges for such a Binary Tree with height 4 is 30. The maximum number of internal vertices for such a Binary Tree with height 4 is 15. 0 The total degree of such a Binary Tree with height 4 is 60. The total number of edges for such a Binary Tree is 19. The total number of internal vertices for such a binary tree with height 4 is 18. Such a Binary Tree does not exist