Please help, trying to complete this by tonight to help me study for my exam, but I am stuck after trying many times.

3. If we had the following has flu rebecca What would the following return? has flu (janet) has flu (john) has flu (x) kisses (K, Y) has flu (Y kisses (janet ,john 4. If we had a one-way road links 6 towns. (i.e. townl----- -----town2---- ----town3 ----town4--- ----town5---- ---town6) Finish writing the program that can work out if you can travel on that road and can get from A to B. connected (town 1,town 2). connected (town 2,town 3). connected (town 3 ,tomm4). connected (town ,town 5 connected (town 5,totm6) can get (x,Y) connected (x, Y) can get (x,Y) connected (x, z), can get 5- Suppose that we are working with the following es, the names are from the movie Pulp Fiction loves (vincent, mia) loves (marcellus, mia) loves (mia, marcellus) loves (pumpkin huney bunny) loves (huney bunny, pumpkin) jealous B):- loves (A,C) loves (B,C), A V- B. (A,B a. Now we pose we have the query jealous (X,Y). What would we get back ifwe asked for all solutions? Show what would be the output. b. Would it make a difference if we removed the last AN If yes how