1. The bearing from the Pine Knob fire tower to the Colt Sta…

1. The bearing from the Pine Knob fire tower to the Colt Station fire tower is N 65° E, and the two towers are 30 kilometers apart.  A fire spotted by rangers in each tower has a bearing of N 80° E from Pine Knob and S 70° E from Colt Station.  Find the distance of the fire from each tower.    Distance of the fire from Pine Knob: [pine] km Distance of the fire from Colt Station: [colt] km   **Round your answers to the nearest hundredths please. 

For the following graph: Suppose that Prim’s algorithm has…

For the following graph: Suppose that Prim’s algorithm has been executed, starting from node F, up to the point at which there are six edges selected for inclusion in the minimal spanning tree. List these edges in the order that they are selected for inclusion, using notation similar to (A, B) to specify an edge. Suppose that the Kruskal’s algorithm has been executed, up to the point where there are six edges selected for inclusion in the minimal spanning tree. List these edges in the order that they are selected for inclusion. Kruskal’s minimum spanning tree algorithm uses a heap to quickly find the lowest cost edge not already chosen. What would be the running time of the algorithm if instead of using a heap, -the algorithm used a simple unsorted array to store the edges?