Write an algorithm to calculate the product of all integers (whole numbers) from a to b, inclusively. Provide both the pseudocode and a flowchart for your solution. You can assume that bgt a

Pseudocode:<br />```<br />1. Start<br />2. Initialize product to 1<br />3. For each integer i from a to b (inclusive):<br /> - Multiply product by i<br />4. Display product<br />5. End<br />```<br /><br />Flowchart:<br />```<br />Start<br />|<br />v<br />Initialize product to 1<br />|<br />v<br />For each integer i from a to b (inclusive):<br />|<br />v<br />Multiply product by i<br />|<br />v<br />Display product<br />|<br />v<br />End<br />```