Q. Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

• (A) the boundary is defined as those nodes in closed that have at least one successor still in open
• (B) the nodes in closed that are not on the boundary are in the kernel
• (C) the number of relay nodes on each path is exactly one.
• (D) both a & b