Write a detailed algorithm/description explaining how to efficiently solve this problem: Suppose two binary search trees (T1, T2) have already been created. Determine whether these two trees are the same--they have the same number of elements and have the same elements. You may use any of the tree and BST methods discussed in lectures, and you can choose whether the trees are implemented as linked trees, or are stored in arrays. Note: While T1 and T2 might be the same (as defined above) they do not need to have the same structure (shape). They might organize the data in the tree in different ways. Estimate the growth function and big O value of your algorithm; explain how you arrive at your answer.

C PROGRAMMING Implement dijkstras alorithm  Check that the Graph graph, and starting node, id, are valid• Create the set S containing all the networks (vertices) except the source node (you might wantto use an array for this.• Create an array to represent the table D and initialise it with the weights of the edges from thesource node, or infinity if no edge exists. You should use the constant DBL_MAX to representinfinity.• Create an array to represent the table R and initialise it with the next hops if an edge existsfrom the source, or 0 otherwise.• Then repeatedly follow the remaining rules of Dijkstra’s algorithm, updating the values in D andR until S is empty.• Each of the values required to complete the above can be found by calling the variousfunctions (get_vertices(), get_edge(), edge_destination(), edge_weight(), etc.)in the supplied graph library.• Once Dijkstra’s algorithm has run, you will need to create the routing table to be returned byallocating enough memory for the…

Create three problem instances of size n is around 10, representing the best-case, worst-case and average-case for Radix Sort respectively. Show how the Radix Sort works on the best-case, and explain why each of them represents the best-case, worst-case and average-case respectively.   psudocode for Radixsort attached

can I have the solution for this question in Java coding please? Write an algorithm for the following to swap two adjacent elements by adjusting only the links (and not the data) using: Singly-linked lists. Doubly linked lists.