) How many routes of length K are present between two given cities? Define a function which takes four inputs - Adjacency 2 matrix, route length, source city (the first city of the route) and the destination city (the last city of the route). 2 Return the number of routes of length K from source city to destination city. For example, calling total_routes_k_steps (Adj, 5, 0, 1) should return the number of routes of length 5 from city 0 to city 1 [10] # Input - Adjacency matrix, length K, source city, destination city #Output feasible routes def total_routes_k_steps (Adj, me mand: # Compute the new adjacency matrix corresponding to ten trips Adj_k = ...

Answer In python Only The question is inspire form the movie name frozen in which there is a land of fire and ice known as frozen land. The land is ruled by mad fire queen. Eurther more frozen land is divided into two territories. first territory is known as ice because it is always snowing and other Fire because of volcano near by area. There is a secret attack on red fort by rebellion force lead by ice queen. There is snitch in rebellion force. He trades the secret attack plan to mad queen. However mad queen has superpower to sense disturbance in the force. He sends out his best knights to scout the rebellion force. She got to know that rebel force outmatch city guards one to hundred In order to win this battle against rebels, the mad king decided to use N common folks as soldiers. She select a bunch of people from a territory and train them Now queen can only pick odd number of people from land of fire and from land of ice in one go. He cannot select bunch of people consecutively…

Q1 Creating RES Give a regular expression for the language I over the alphabet = {0, 1}, where every string in I must contain the substring 110, but cannot have more that two consecutive O's. For example, 110 € L, 1100 € L, 11000 € L, 1111011111 EL, 1011010111 L, 1011010011 L, 1011010001L, 01010 € L