Question: any language is fine, as long as the for loop works Counting from 0s each level n of the triangle should consist of 2n+1 asterisks

any language is fine, as long as the for loop works
Counting from 0s each level n of the triangle should consist of 2n+1 asterisks
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
