Answer:
The digital footprint that is had behind can have repercussions in every aspect of your adolescent's life, conceivably bringing about botched occupation chances, public sharing of individual data, destroyed connections
Explanation:
Digital trail what's left behind as you calmly peruse the web, post via web-based media or even sort into a visit administration. Regardless of whether you're mindful, you add to your advanced impression or profile every day when you sign onto the Internet. The sites you visit, the news posts you remark on, the remarks you leave via web-based media stages—every one of these things meet up to make a representation of your online life.
The digital footprint that is had behind can have repercussions in every aspect of your adolescent's life, conceivably bringing about botched occupation chances, public sharing of individual data, destroyed connections — or, in what is likely more pertinent to them at this moment: Their folks discovering what they've been up to and along these lines being rebuffed.
Answer:
Superscript or Subscript
Explanation:
The superscript or the subscript is a type of character which is set a little lower or more than the normal line of type. And it is generally small as compared to the other texts. The subscript does appear at or less than the baseline, and the superscript is above. And for the superscript, you need to press the Ctrl + Shift + + ( press and at the same time also hold the Ctrl and the Shift, and finally press the +). And for the subscript, you need to press the Ctrl + Shift ++(Press and at the same time also hold the Ctrl. and finally press the =). And pressing the corresponding shortcut once again, you will be back to the normal text.
Answer:
Explanation:
Click Spelling and Grammar and choose AutoCorrect,
B- find and replace can replace any word in the document with another.
Answer:
see explaination
Explanation:
void insertion( int e,int *x, int start, int end)
{
if (e >= x[end])
x[end+1] = e;
else if (start < end)
{
x[end+1] = x[end];
insertion(e, x, start, end-1);
}
else
{
x[end+1] = x[end];
x[end] = e;
}
}
void insertion_recurssion(int *b, int start, int end)
{
if(start < end)
{
insertion_sort_recur(b, start, end-1);
insertion(b[end], b, start, end-1);
}
}
void main()
{
insertion_recurssion(x,0,5);
}