For a CSP with $5$ variables of domain size $2$ in a search tree where all the complete assignments are leaf nodes at depth $5.$ In this search tree, how many possible complete assignments can be made:a$)5!*25$ b$)5!$c$)32$d$)64$e$)160$