Given the Boolean function F in three variables R, S and T as F=$$\,\overline R \,S\overline T + R\overline {S\,} T + RST$$

(a) Express F in the minimum sum-of-products from.
(b) Express F in the minimum product-of-sums from.
(c) Assuming that both true and complement froms of the input variables are avialable, draw a cicruit to implement F using the minimum number of 2input NAND gates only.