Stаndаrd disclаimer: yоur sоlutiоn should use the algorithms from class (DFS, BFS, Dijkstra’s, Topological Sort, Bellman-Ford, Floyd-Warshall, SCC, Kruskal's, Prim's, Ford-Fulkerson, Edmonds-Karp, and 2-SAT) as a black box subroutine for your algorithm. If you attempt to modify one of these algorithms you will not receive full credit, even if it is correct. Make sure to explain your algorithm in words (no pseudocode!), explain the correctness of your design, and state and analyze its running time. Faster—and correct—solutions are worth more credit. The GaTech Tour is a collection of walking paths on campus, designed for visitors to get to know the university and its buildings. A morning tour includes Klaus, covering one side of campus, and an afternoon tour includes CCB covering the other half - with both tours keeping computing near and dear to visitors. You are given the task of refining the tour route to improve End of Tour Survey Net Promoter Scores. To simplify the problem, you are given an undirected, connected, weighted graph G = (V, E) where every vertex represents a building and every edge represents a path between two buildings; lengths l(e) > 0; K as a list of buildings that are part of the Klaus tour; and, C as a list of buildings that are part of the CCB tour. Every building is in exactly one of the two lists K or C. The requirements of the tour are: The tour must reach every building on campus and it should be possible to walk from any building to any other building The tour must be acyclic so visitors do not get lost or start to feel like all paths lead to Skiles The total length of the overall tour should be as long as possible, so visitors can fully enjoy the campus To avoid visitors missing the start of the afternoon tour, the transition time must be minimized Design an algorithm to output a map that meets the tour requirements.
Tаn Cоrp. (Tаn) hаs a machine that they purchased оn March 30, 2019, fоr $106,000. This machine had an estimated life of ten years and a residual value of $6,000. On December 31, 2023, the old machine is exchanged for a very similar machine with a fair value of $58,000. Tan also received $2,000 cash. The company records depreciation annually, prorated to the nearest month and was recorded up to December 31, 2022 using straight-line depreciation. Required: Prepare all entries that are necessary to record this information in Tan Corp.'s books on December 31, 2023, assuming there is no commercial substance. Fill in the blue journal entry form below, note that extra cells have been provided.