Modify BST_Recursive.java of Lab-10:Exercise\#2 to write a complete program to implement a spare-parts database with itemNo, price and description. Provide options to insert, search, delete, and show all items in order of itemNo. Sample run of the program WWamsin: Cheating in homework witl resuit in zero marks... (saine progranis wil getod] Write a Java program for Dijkstra's algorithm for shortest path using Lab-11: Exercise\#2 as base code to start with. improve the base code to modify it for: - Input the Edges (u, v,w ) from user where triplet represents the undirected edge from vertex u to vertex v having weight w. - Find the shortest path from first node as source to all other nodes as destinations. Hint- You need to modify only the main method. Whaeneigi Cheatine in bomework will result lil zero tiarks wi isaine prourams wil ant ond Sampie run of the progam Eniler Tho mamber of eofos 3 Enter the values for edge 0 finser The values of U 0 Enier The values of V 1 Enter The value of W 10 Enter the values for edge 1 Enier The values of C 1 Einer The values of Y 2 Emer The valuc of W 10 Enter the values for edge 2 Finter The values of O 0 Ener The valucs of V 2 Filie The valuer of W 15 Path (0>1) : Minimum Cost =10 and Route is [0,1] Path (02): Minimum Cost =15 and Route is [0,2] Graphs can be represented by Adjacency Matrix which is basically An array of lists. A two-dimensional array. A circular linked list. A one-dimensional array