Question 5 Consider the special case of a SNG problem where you also know the age of the person. A state can thus be Baby, Child, Teenager, Adult, Elder. We also know the following: A Baby is only connected to Teenagers or Children. It is connected to atleast one Teenager A child is only connected to Adults or Elders. It is connected to atleast one Adult A Teenager is only connected to Teenagers or Adults. It is connected to atleast one Adult An Adult is only connected to other Adults or Elders. It is connected to atleast one Adult An Elder is only connected to other Elders or Babies. It is connected to atleast one Baby All the links are Uni-Directional tas opposed to a normal SNG where they are bi-directional) . ve that you are trying to find the degrees of separation between a person and the closest Elder. Using this emation come up with a maximally admissible heuristic for this search problem, Question 5 Consider the special case of a SNG problem where you also know the age of the person. A state can thus be Baby, Child, Teenager, Adult, Elder. We also know the following: A Baby is only connected to Teenagers or Children. It is connected to atleast one Teenager A child is only connected to Adults or Elders. It is connected to atleast one Adult A Teenager is only connected to Teenagers or Adults. It is connected to atleast one Adult An Adult is only connected to other Adults or Elders. It is connected to atleast one Adult An Elder is only connected to other Elders or Babies. It is connected to atleast one Baby All the links are Uni-Directional tas opposed to a normal SNG where they are bi-directional) . ve that you are trying to find the degrees of separation between a person and the closest Elder. Using this emation come up with a maximally admissible heuristic for this search