Duality discrete math problem

The dual of a compound proposition that contains only the logical operators ∨ , ∧ , and ¬ is the compound proposition obtained by replacing each ∨ by ∧ , each ∧ by ∨ , each T by F , and each F by T . The dual of s is denoted by s∗. Find the dual of these compound propositions.

a) $p\vee \mathrm{\neg}q$

I got $\mathrm{\neg}p\wedge q$

b) $p\wedge (q\vee (r\wedge \mathrm{T}))$

My answer was $\mathrm{\neg}p\vee (\mathrm{\neg}q\wedge r)$

c) $(p\wedge \mathrm{\neg}q)\vee (q\wedge \mathrm{F})$

My answer was $(\mathrm{\neg}p\vee q)\wedge \mathrm{\neg}q$

The dual of a compound proposition that contains only the logical operators ∨ , ∧ , and ¬ is the compound proposition obtained by replacing each ∨ by ∧ , each ∧ by ∨ , each T by F , and each F by T . The dual of s is denoted by s∗. Find the dual of these compound propositions.

a) $p\vee \mathrm{\neg}q$

I got $\mathrm{\neg}p\wedge q$

b) $p\wedge (q\vee (r\wedge \mathrm{T}))$

My answer was $\mathrm{\neg}p\vee (\mathrm{\neg}q\wedge r)$

c) $(p\wedge \mathrm{\neg}q)\vee (q\wedge \mathrm{F})$

My answer was $(\mathrm{\neg}p\vee q)\wedge \mathrm{\neg}q$