If possible, develop a scalable bit$-$sliced design scheme for the following function F$.$ If it is not possible, explain why not. Given two n$-$bit vectors A and B$,$ F $=1$ if and only if NOR$($A$-1.$ An$-2...$ Ao$)=$ NOR$($B n$-1,$ Bn$-2,...$ Bo$).$ Show the logic design of a slice. Show how the slices should be connected to form an N bit design. Indicate the initial value$($s$)$ of the interslice signal$($s$).$ Note that the N$-$bit version can only contain N slices and wires: no additional gates are allowed. $1.$ Is the NOR function$$associative$?$