Given a sequence ofndistinct numbersa1, a2, ..., an, an inversion is a pair of numbersaiandaj, wherei > jandai< aj. That is, if the sequence is in ascending order then there is no inversion.(a) Design an algorithm to count the number of inversions in a given sequence which runs inO(n2) time.(a)
Design a divide-and-conquer algorithm to count the number of inversions in a given sequencewhich runs inO(nlogn) time.

Which are not examples of chronic or persistent stress? moving

Why would a programmer use the logical operator and in an if statement? a: when an action is to be taken that requires both conditions to be falseb: when an action is to be taken that requires both conditions to be truec: when an action is to be taken that requires the first condition to be falsed: when an action is to be taken that requires the second condition to be truei took the test and the answer is b.

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it