Counting pairs by the element $x$: each of the $n$ elements lies in $2^{n-1}$ subsets, so $|A|=n2^{n-1}$. Counting by the size $k$ of $X$, there are $\binom nk$ subsets, each with $k$ choices for $x$, which gives $\sum k\binom nk$. Both are true (and equal).
More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions
GATE 2018 CS Q11– Which one of the following is a closed form expression for the generating function of the…
GATE 2015 CS (CS1) Q45– Let a n represent the number of bit strings of length n containing two consecutive 1s.…
GATE 2016 CS (CS1) Q12– Let a n be the number of n-bit strings that do NOT contain two consecutive 1s. Which one…