1. Write a java program named BSTree.java that will a. Generate 100 random integer numbers ranging from 1-99 b. Build a Binary Search Tree using this set of numbers c. Delete 50 and 60 from the Binary Search Tree and rebuild the tree d. After building the tree, display the data into three formats: prefix order, infix order and postfix order. 2. Consider the following graph and write a java program that will 10 a. Generate a minimum spanning tree using Prim's algorithm and finally compute the total cost b. Generate a minimum spanning tree using Kruskal's algorithm and finally compute the total cost Sample Input/Output: Your output screen should be considered the term mentioned below Enter the mumber of modes:6 Enter the ad jacency matrix: 1 5 O56 4 05002 366 Edge 1:C1 3) cost:1 Edge 2 C1 Edge 3: C2 50 cost:3 Edge 4C3 6 COSt:4 Edge 5: 6 4 cos Min i muun cost-13 2) Cost