java Use a loop to count how many times the characters java and python are found in the given String sentence. Output true if java and python appear the same number of times, otherwise output false. Note: Case sensitivity should be considered. We are looking for the lowercase character versions of both Strings

Read string integer value pairs from input until "Done" is read. For each string read: • If the following integer read is less than 40, output the string followed by ": low on stock". • Otherwise, output the string followed by ": well stocked". End each output with a newline. Ex: If the input is Oven 43 Curtain 7 Pillow 1 Done, then the output is: Oven: well stocked Curtain: low on stock Pillow: low on stock 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } * Your code goes here */ return 0;

Using c++ Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…