B) What are the differences between array and linked list. C) What is meant by Binary Search Tree, (1) construct a binary tree by inserts the given values: (35, 33, 50, 10, 60, 22, 17, 48, 92,55,7). (2) Insert 58, 25 respectively (3) Delete 92, 35.

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.

Input order: Student ID: Islam, Md. Rashedul Tree input order: 5,4,1,9,2,3,8,6,7 Part A:Build a Binary Search Tree with the given input order. You must show step by stepprocess of inserting the inputs including both recursive calls and tree diagrams foreach step. [ refer to the InsertItem function of Lecture10 slides to get an idea ofdoing this.]N.B: Unique Input orders for each student to build the tree are given on a separatefile. Write down the input order on your answer script before answering the question.You must use the assigned input order. Do not change the order. InserItem function: void Insert(TreeNode *&tree, ItemType item) {   if (tree == NULL)//Base case:Insertion place found.   {     tree = new TreeNode;     tree->right = NULL;     tree->left = NULL;     tree->info = item;   }   else if (item < tree->info)     Insert(tree->left, item);//General case 1:Insert in left subtree.   else     Insert(tree->right, item);//General case 2:Insert in right…