Make vhdl code and test bench code for the algorithm Algorithm for Non-restoring division is given in below image start A=0 M-Divisor Q-Dividend Count -N shift Left A,Q Shift Left A,Q A A-M | 20-o- count-count-k- 20-1 no count-0 yes Lyes A=A+M no End Make vhdl code and test bench code for the algorithm Algorithm for Non-restoring division is given in below image start A=0 M-Divisor Q-Dividend Count -N shift Left A,Q Shift Left A,Q A A-M | 20-o- count-count-k- 20-1 no count-0 yes Lyes A=A+M no End