GATE Computer Science (CS) 2014 Shift 2 Solved Paper

The dual of a Boolean function F(x₁, x₂, … , x_n, +, ∙ , ′), written as F^D, is the same expression as that of F with + and ⋅ swapped. F is said to be self-dual if F = F^D. The number of self-dual functions with n Boolean variables is