mplement the circuit described by the Karnaugh map below.
Try to simplify the k-map before coding it. Try both product-of-sums and sum-of-products forms. We can't check whether you have the optimal simplification of the k-map. But we can check if your reduction is equivalent, and we can check whether you can translate a k-map into a circuit.
译：实现下面卡诺图描述的电路。
在编码之前尝试简化Karnaugh图。尝试使用“乘积求和”和“和积求和”形式。我们无法检查您是否对Karnaugh图进行了最佳简化。但我们可以检查您的简化是否等效，并且我们可以检查您是否能将Karnaugh图转换为电路。
module top_module(
input a,
input b,
input c,
output out );
assign out = a | b | c ;
endmodule
运行结果：
