[4] 4. a) How does the following algorithm work for the given binary tree? Here, Queue is a FIFO data structure. 2 Queue root while(Queue !=Empty){ vQueue print*, v 3 // Insert root into Queue // Delete a vertex from Queue and store it into v // Display v if (Left_Child(v) exists) Queue Left_Child(v) // Insert left child of v into Queue if (Right_Child(v) exists) Queue Right_Child (v) // Insert right child of v into Queue } b) Construct a unique binary tree from the following tree traversal sequences. Inorder: SBHEMLICG [3] Postorder: SHEBILGCM [3] c) Draw a binary search tree (BST) for the data given below. Sow the steps to delete 40 from the BST. 10, 20, 30, 40, 50, 60