Answer:
3, 4 , 5 , 6 is your answer.
I HOPE IT WILL HELP YOU.
Thank you.
<u>TEDDYLOVER</u><u>.</u><u>.</u><u>.</u><u>.</u>
The base case is the claim that

which reduces to

which is true.
Assume that the inequality holds for <em>n</em> = <em>k </em>; that

We want to show if this is true, then the equality also holds for <em>n</em> = <em>k</em> + 1 ; that

By the induction hypothesis,

Now compare this to the upper bound we seek:

because

in turn because

Answer:
Steps for Constructing the Incenter of a Triangle
Step 1: Construct an angle bisector for one of the angles of the triangle. ... Step 2: Construct an angle bisector for another angle of the triangle. ... Step 3: Find the point where these two angle bisectors intersect.
Step-by-step explanation:
Mulityply 3 x 3 u will get 9 and add it by 18 u will get 27