Write a Prolog program that describes bus routes between cities. Use the predicate connect$/2$ to describe the cities between which the bus runs, e$.$g$.$ connect$($saldus$,$skrunda$)$ and the predicate connect$/2,$ which finds possible connections between two cities, including those that require a transfer. Note. The program may not include inverted routes, e$.$g$.$ if you have connect$($saldus$,$ skrunda$)$ and connect$($skrunda$,$ liep$\backslash$bar $($a$)$ ja$),$ then the predicate route$($saldus$,$ liep$\backslash$bar $($a$)$ ja$)$ must find connections saldus$-$skrunda$-$liep$\backslash$bar $($a$)$ ja and print out the full route the traveler must have, but route$($liep$\backslash$bar $($a$)$ ja$,$ saldus$)$ may not find the route. You need to make a logic that will not allow the traveler to visit each city more than one time