Subject - Computer Science (DEEP LEARNING)

Please answer by 12:00pm IST Sunday (Jan 24) last date for assignment. Urgent Please.. I will 100% upvote

Design a recurrent neural network that predicts the next character in the input string abbabbabba. Each character in the string is input from left to right to the network. That is: Input: 2,6,6,4,6,6,, .... Output: 6,6,4,6,6,7,6, .... Assume a single bit representation for a, b, i.e., a=0, b=1. All nodes use step activation, i.e., output = 1 if total input >=0, otherwise 0. Recall, the RNN accepts input vector x. Hidden states and output are, respectively, denoted by h, and y. by W bh [2+ 3 +2=7 Marks] Note, at time t, ht=step(Wht-1 + Us - bh) and yt = step(vht-by) A. What is the minimum number of hidden node needed? "Show the state transition diagram and enumerate the states with RNN hidden states." B. Express the current hidden states has Boolean functions of past hidden states ht-1 and current input I. Express the current output yt as a Boolean function of current hidden states het. C. For the obtained Boolean functions, specify weight matrices U, V, and W, bias vectors bh and bias by. Elements of U, v and W can be only-1, 1, 0."Bias values are 0 or positive integers only