I need help with this question please, regarding time complexity of BobSort and Sorting Analysis in C++. The question is: BobSort corrects one inversion per comparison. What is its worst case number of comparisons and why?

In C++: Explain and show how to use the recursive function int gcd (inta, int b).

Can someone help me with this question in C++ and not any other programming language No library functions that leverage hash and maps can be used except to make it all lowercase List sentence(s) with the maximum no. of occurrences of the word "the" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "of" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "was" in the entire file and also list the corresponding frequency. here is a link too the file its called tiny1 https://drive.google.com/file/d/1ariNN_rW9c3vijK1hvjObcQJafYQ2gzm/view?usp=sharing

Sorry - I need to resubmit this Question The makefile I had was misinformed. Please make a makefile for progran language C: these programs [sort158a.c, merge.c, mergesort.c, mergesort.h, and wrt.c]And follow the layout of the makefile Please dont include: CC = gcc CFLAGS = -Wall -Werror OBJDIR = obj BINDIR - $Use the makefile how It is like mine!

I'm stuck on this question and I don't know how I should be approaching this. What should I do? Our focus is on pointers and dynamic arrays through C++

Please help with C++Priority Queue question in C++ language. Sample output also in image. Thanks.