by using quartus write verilog code about

Specification The following C code calculates the number of times the value x is not found within an array A consisting of 256 8-bit values. Inputs: byte a [256], byte x, bit go Outputs: byte freq, bit done 1 Requirements Design a digital system that implement the above algorithm. Divide your design into data path and control unit. Use SM chart to design your control unit. Block Diagram The top-level module has a go signal to start the process when asserted high for one clock cycle and a done signal to indicate the end of the process when asserted high for one clock cycle. The 8-bit input x is the searching key. The 2568ROM stores the array A. The output frequency outputs the number of times the value x is not found in the array A(2568) when the done is asserted high. The system reads an 8-bit data addressed by an 8-bit address. Your Design You should follow all design steps. - Start with the top-level block diagram and identify all external (primary) inputs and outputs for the whole design (given above). - Divide your design into two units: Data Path unit and Control Unis. - Design the Data Path Unit: Identify the required blocks and connect them. List all control and status signals. - Use SM chart to design the Control Unit: Identify the required control and status signals