dict_graph = {}     # Read the data.txt file with open('data.txt', 'r') as f:     for l in f:         city_a, city_b, p_cost = l.split()         if city_a not in dict_graph:             dict_graph[city_a] = {}         dict_graph[city_a][city_b] = int(p_cost)         if city_b not in dict_graph:             dict_graph[city_b] = {}         dict_graph[city_b][city_a] = int(p_cost)     # Breadth First Search Method def BreadthFirstSearch(graph, src, dst):     q = [(src, [src], 0)]     visited = {src}     while q:         (node, path, cost) = q.pop(0)         for temp in graph[node].keys():             if temp == dst:                 return path + [temp], cost + graph[node][temp]             else:                 if temp not in visited:                     visited.add(temp)                     q.append((temp, path + [temp], cost + graph[node][temp]))     # Depth First Search Method def DepthFirstSearch(graph, src, dst):     stack = [(src, [src], 0)]     visited = {src}     while stack:         (node, path, cost) = stack.pop()         for temp in graph[node].keys():             if temp == dst:                 return path + [temp], cost + graph[node][temp]             else:                 if temp not in visited:                     visited.add(temp)                     stack.append((temp, path + [temp], cost + graph[node][temp]))     # Iterative Deepening Search Method def IterativeDeepening(graph, src, dst):     level = 0     count = 0     stack = [(src, [src], 0)]     visited = {src}     while True:         level += 1         while stack:             if count <= level:                 count = 0                 (node, path, cost) = stack.pop()                 for temp in graph[node].keys():                     if temp == dst:                         return path + [temp], cost + graph[node][temp]                     else:                         if temp not in visited:                             visited.add(temp)                             count += 1                             stack.append((temp, path + [temp], cost + graph[node][temp]))             else:                 q = stack                 visited_bfs = {src}                 while q:                     (node, path, cost) = q.pop(0)                     for temp in graph[node].keys():                         if temp == dst:                             return path + [temp], cost + graph[node][temp]                         else:                             if temp not in visited_bfs:                                 visited_bfs.add(temp)                                 q.append((temp, path + [temp], cost + graph[node][temp]))                 break     n = 1 print (dict_graph) print ("------------------------------------------------") while n == 1:     x = input("enter the type of search you want to do \n 1.BFS 2.DFS 3.ID \n ")     if x == 1:         src = raw_input("Enter the source: ")         dst = raw_input("Enter the Destination: ")         while src not in dict_graph or dst not in dict_graph:             print ("No such city name")             src = raw_input("Enter the correct source (case_sensitive):\n")             dst = raw_input("Enter the correct destination(case_sensitive):\n ")         print ("for BFS")         print (BreadthFirstSearch(dict_graph, src, dst))       elif x == 2:         src = raw_input("Enter the source: ")         dst = raw_input("Enter the Destination: ")         while src not in dict_graph or dst not in dict_graph:             print ("No such city name")             src = raw_input("Enter the correct source (case_sensitive):\n")             dst = raw_input("Enter the correct destination(case_sensitive):\n ")         print ("for DFS")         print (DepthFirstSearch(dict_graph, src, dst))       elif x == 3:         src = raw_input("Enter the source:")         dst = raw_input("Enter the Destination: ")         while src not in dict_graph or dst not in dict_graph:             print ("No such city name")             src = raw_input("Enter the correct source (case_sensitive):\n")             dst = raw_input("Enter the correct destination(case_sensitive):\n")         print ("for ID")         print (IterativeDeepening(dict_graph, src, dst))       #n = input("enter 1 if you wish to continue:\n") Check these codes and fix the errors

Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 7^2 + 5^2. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares.To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 7^2 + 6^2 and 9^2 + 2^2 , of which this function must return (9, 2).The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere is directly applicable to this problem. In this problem, these indices crawl towards each…

Python I have a class QueryBuilder: def QueryBuilder(Data_Base, Query_Type, Query_Tuple):''' Build Query_String '''if Query_Type == "version":query_string = "SELECT sqlite_version()"elif Query_Type == "delete":query_string = "DELETE FROM {0} WHERE id = ?".format(Data_Base)elif Query_Type == "select":query_string = "SELECT * FROM {0} WHERE name = ?".format(Data_Base)elif Query_Type == "insert":query_string = "INSERT INTO {0} (id, name, photo, html) VALUES (?, ?, ?, ?)".format(Data_Base)elif Query_Type == "table":query_string = '''CREATE TABLE Database (id INTEGER PRIMARY KEY,name TEXT NOT NULL,photo text NOT NULL UNIQUE,html text NOT NULL UNIQUE)'''.format(Data_Base)else:raise ValueError("Invalid query type")return query_string Please use it to write more code below: Purpose:  Create and use a Database Data Files:  Use BS4, Regular Expressions or Pandas to read in the two data files for this assignment: Co2.html: <TABLE summary="csv2html program…

main.cc file #include <iostream>#include <memory> #include "customer.h" int main() {  // Creates a line of customers with Adele at the front.  // LinkedList diagram:  //   Adele -> Kehlani -> Giveon -> Drake -> Ruel  std::shared_ptr<Customer> ruel =      std::make_shared<Customer>("Ruel", 5, nullptr);  std::shared_ptr<Customer> drake =      std::make_shared<Customer>("Drake", 8, ruel);  std::shared_ptr<Customer> giveon =      std::make_shared<Customer>("Giveon", 2, drake);  std::shared_ptr<Customer> kehlani =      std::make_shared<Customer>("Kehlani", 15, giveon);  std::shared_ptr<Customer> adele =      std::make_shared<Customer>("Adele", 4, kehlani);   std::cout << "Total customers waiting: ";  // =================== YOUR CODE HERE ===================  // 1. Print out the total number of customers waiting  //    in line by invoking TotalCustomersInLine.  //…