Minimum Cost Travel

Problem Statement

Minimum Cost Travel Problem Description You are given a question of minimum cost of traveling between two train stations in a circular city with N train stations numbered from 1 to N. The cost of tickets between adjacent stations is given in an array ticket_cost , where ticket_cost[i] represents the cost of traveling from station i to station (i+1)%N . The problem asks you to find the minimum cost to travel from a given start station to a given finish station. The output should be the minimum cost of traveling from start to finish station. This function takes the following arguments and finds the minimum cost to travel between the given start and finish station. Parameters: N : Represents the total number of train stations. start : Represents the start station. finish : Represents the finish station. ticket_cost : Represents ticket_cost[i] denoting the ticket-cost between the station number i and (i+1)%N . Input Format: The first line contains an integer N denoting the total number of