Consider the following CSP problem:

Variables: $x=\{A,B,C,D,E,F,G\}$

Domains: $D_A=D_B=D_C=D_D=D_E=D_{\frac{?}{\text{b}\text{a}\text{r}}(F)}=D_G=\{1,2,3\}$

Constraints: $C=\{AB,AC,AE,BE,BG,CE,CG,DG,EG,FG\}$

Your CSP search is exploring a tree and the current PARTIAL assignment is:

$A=1,$

$B=2,$

$C=2,$

$D=1$

Use the MRV heuristic to decide which variable to explore $($assign a value to$)$ next.

In case of ties, use degree heuristics $($if that does not help: alphabetic ordering$).$

Justify your answer.