From the following list of bus rapid transit system (one way): Name        Route Vacation    A->B->C->D Work 1      E->B->F->G->H Work 2      B->N->E Work 3      H->D->N The problem: ➢ Task: Design an algorithm to read the bus rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. ➢ PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm.

In python, Problem Description:You are hosting a party and do not have room to invite all of your friends. You use the following unemotional mathematical method to determine which friends to invite. Number your friends 1, 2, . . . , K and place them in a list in this order. Then perform m rounds. In each round, use a number to determine which friends to remove from the ordered list. The rounds will use numbers r1, r2, . . . , rm. In round i remove all the remaining people in positions that are multiples of ri (that is, ri, 2ri, 3ri, . . .) The beginning of the list is position 1. Output the numbers of the friends that remain after this removal process. Input Specification:The first line of input contains the integer K (1 ≤ K ≤ 100). The second line of input contains the integer m (1 ≤ m ≤ 10), which is the number of rounds of removal. The next m lines each contain one integer. The ith of these lines (1 ≤ i ≤ m) contains ri ( 2 ≤ ri ≤ 100) indicating that every person at a position…

The Humane Society’s goal is to find adoptive homes for each of the animals in their care. Design a program that lets theuser enter the total animals adopted on each weekday … Monday through Friday … into a LIST. The program shouldcalculate and display the total number of animals adopted during the week, the average number of animals adopted perday, the highest number and the lowest number adopted per day. (Note that you should use a LIST to store thenumbers, and you should use a TUPLE to store the names of the days of the week, then use a loop to process the tuple.)

This task involves writing a program that calculates the standard deviation of all numbers in a list. First, the number of the number in the list is entered, then each number is entered. The program should print the standard deviation of the numbers in the list. Note, the values ​​entered into the program are part of a random sample, which may need to be taken into account when choosing a method to calculate the standard deviation.

A company keeps a table containing the salary and boss of each employee. Here is an example: Name Salary Boss Fred 27000 James John 36000 Cindy Mary 39000 Tom Adam 23000 Mary Write an algorithm to count the number of employees who earn more than their boss.

Estimated Completion Time: 1 minute Given the following function header: def longest_chain(1st: list[int]) -> int: Given a list of integers, return the length of the longest chain of 1's that start from the beginning. Precondition: 1st is non-empty which one of the cases below is the least useful to check? Select the best answer. O longest_chain([0]) O longest_chain([0) O longest_chain([1, 1, 0]) O longest_chain([1, 1, 0, 1) O longest_chain([1, 0, 1, 1))