## Discussion Forum

Que. | Consider the following first order logic formula in which R is a binary relation symbol. ∀x∀y (R(x, y) => R(y, x)) The formula is |

a. | satisfiable and valid |

b. | satisfiable and so is its negation |

c. | unsatisfiable but its negation is valid |

d. | satisfiable but its negation is unsatisfiable |

Answer:satisfiable and so is its negation |