Problem $1($Sampling a uniformly at random feasible solution to a DNF$).$

Suppose $$ is a DNF formula on $n$ variables $x=(x_1,$dots,$x_n)$ and $m$ disjunctions$/$AND$-$clauses. Let $U$

be the set of satisfying assignments of $,$ that is$,U$:$=\{n\frac{?}{in}\{0,1{\}}^n$:$(x)=1\}.$ Describe a Las$-$Vegas

randomized algorithm which takes $$ as input and returns $x$ uniformly at random from $U.$ What is the

expected running time

$?$