Answer:
C
Explanation:
Well, in your inquiry it says
"A presentation software that is used to organize and present pertinent information using graphics, word processing, outlining, drawing, and presentation management tools"
We know it isn't Microsoft Word, because Microsoft Word doesn't have a presentation feature. We know it isn't Excel because Excel is only meant for spreadsheet and analytics data.
However, on PowerPoint all these points make sense, PowerPoint is a tool that Microsoft created for the capabilities such as to present information, you can also put information inside of graphics as well, you can also draw, and outline too.
1) Use a good cam 2) Make sure you focus on it 3) Make sure you snap it at the right time.... I hope this helps!!!!!
Answer:
tabs.
Explanation:
Microsoft Word refers to a word processing software application or program developed by Microsoft Inc. to enable its users to type, format and save text-based documents.
In Microsoft Word 2019, the users are availed with the ability to edit the word document in the following view type;
I. View Mode.
II. Print Mode.
III. Drift Layout.
To easily and quickly convert text to tables in Microsoft Word, you should insert common separators between the text columns. The common separators or delimiters used when converting a table to text include tabs, paragraph marks, or commas.
Tabs or commas are used to indicate where the texts are divided into table columns while paragraph marks indicate where a new table row begins.
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that 
returns indeed the sum of the first n-1 odd numbers, and we have to proof that 
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, is the sum of the first n odd numbers, as required:
