Suppose an array is given A = [A, C, E, F, K, L, M, N, Y, Z]   a.  Draw a complete TERNARY tree from array A.b.  Write preorder and postorder traversal for the created complete ternary.c.   Draw the adjacency matrix and adjacency list for the complete ternary tree/graph. [You must consider the tree direction from top to bottom when drawing adjacencymatrix and list]

Minimum Spanning Trees (MST): Finding a Minimum Spanning Tree for the following graph based on each of the following algorithm. You need to show the procedures step-by-step. You could directly draw the final MST but indicate the sequence of your search by writing a series of letters, i.e. (a), (b), (c)… under the edges of the MST. This type of answer is preferred. Or else, you need to draw a graph for each step separately.  Kruskal’s algorithm.  Prim’s algorithm (start with the node ‘ORD).

Draw a binary search tree for the following numbers as elements: 60, 75, 43, 65, 16, 53, 25,46, 63, 62, 55, 42, 70, 64.

A method to find the number of primes in BST in a Binary Search Tree (BST) consisting of integers. Function prototype: int countOfValue(Node root) Note: Do not forget to add descriptive comments.

Create a function that takes an array that represent a Binary Tree and a value and return true if the value is in the tree and, false otherwise. Examples valueInTree (arr1, 5) valueInTree (arr1, 9) valueInTree (arr2, 51) - true 1 false false

For the set of numbers {14, 7, 12, 20, 2, 18, 17, 10, 3, 5, 16, 19, 8} 3. Generate pseudocode for a function that will find the maximum value in the tree, in the mostefficient manner (i.e. not linear search)

: You are implementing a binary search tree class from scratch, which, in additionto insert, find, and delete, has a method getRandomNode() which returns a random nodefrom the tree. All nodes should be equally likely to be chosen. Design and implement an algorithmfor getRandomNode, and explain how you would implement the rest of the methods.

Given a binary tree, write a function that prints the binary search tree’s nodes level by level, for example the following tree will have the following output statement:1, 2, 3, 4, 5

: A binary search tree was created by traversing through an array from left to rightand inserting each element. Given a binary search tree with distinct elements, print all possiblearrays that could have led to this tree.EXAMPLEInput: 1<-2->3Output: {2, 1, 3}, {2, 3, 1}