Consider the Hamming distance function h(v), defined for finite binary states in a search graph, where the current state is denoted as v and the target state as t. Binary representations of states are denoted as B(v) and B(t). B(v)B(t)=v1v2vn=t1t2tn The Hamming distance function is defined as follows: h(v)=i=1n(vi,ti) where (vi,ti) is the Kronecker delta function, which is 0 if vi=ti (bits are pqual) and 1 otherwise. Prove that the function h(v) is monotonic and admissible