Write a function to determine the prime number, input an integer in the main function, and output the information whether it is a prime number or not solve

Write a function to determine the prime number, input an integer in the main function, and output the information whether it is a prime number or not solve

#Include & lt & lt; isostream & gt; how to & nbsp; include & amp; lt & amp; lt; sososojourn & nbsp; how & nbsp; how to & nbsp; how to & nbsp; how & nbsp; how to & nbsp; how & nbsp; how to & nbsp; the & amp; bool & nbsp; issushu ((int) & nbsp; bool & nbsp; is (issushu ((int); / / / / / / / / / / / / / / / / / / / // / checks whether it is a prime number, and whether it is a prime. This is a void & nbsp & nbsp & nbsp & nbsp & nbsp; in this & amp & amp & amp & amp & nbsp; this & amp & amp & nbsp; how & amp; all & amp & nbsp; all & amp; all & amp & amp & amp; how & amp; includes & lt & lt & lt & lt & lt; colcolcolcol & amp; & amp; & amp; & lt; & lt; & lt; & lt; & lt; & lt; sosososososososososo& lt; & lt; endl;} & nbsp; }Bool & nbsp; issushu (int & nbsp; a) {if & nbsp; (a = = 2) {return & nbsp; true;} for (int & nbsp; I = 2; I & lt; a; I + +) {if & nbsp; (a% I = = 0) {return & nbsp; false;}}} return & nbsp; true;} & nbsp; [beauty of mathematics] I'm glad to answer for you. If you don't understand, please ask! Please accept if you are satisfied, thank you_ ∩)O~