Use VB.net to create a loop that posts the first 100 prime numbers. Then, write code to confirm the numbers are prime.

Define price discrimination. Explain the difference between first-degree and third-degree price discrimination with two examples of each. Your answer will not be complete without two examples of each.

Provide your answer here. DO NOT TRY TO COPY/PASTE YOUR ANSWER.

Assume that the market demand function is: Q(D) = 2000 - 5P And the market supply function is: Q(S) = 100 + 5P Assume that the government passes legislation that sets the maximum price to $100 a unit. Which of the following statements are correct (multiple statements may be correct)?

1.) At a legally mandated price of $100 a unit, quantity demanded is equal to 1050 and quantity supplied is equal to 1050, therefore the legally mandated price has no impact on the market.

2.) At a legally mandated price of $100 a unit, quantity demanded is equal to 1500 and the quantity supplied is equal to 600, therefore the shortage is equal to 900 units.

3.) At a legally mandated price of $100 a unit, quantity demanded is equal to 600 while quantity supplied is equal to 1500, therefore there is a surplus in the market of 900 units, not a shortage.

4.) At a legally mandated price of $100 a unit, quantity demanded rises from 1050 units to 1500 units and quantity supplied falls from 1050 units to 600 units, resulting in a shortage of 900 units.

Answer the following questions on the basis of the three sets of data for the country of North Vaudeville:

a. Which set of data illustrates aggregate supply in the immediate short-run in North Vaudeville?     


Which set of data illustrates aggregate supply in the short run in North Vaudeville?     

  
Which set of data illustrates aggregate supply in the long run in North Vaudeville?      

b. Assuming no change in hours of work, if real output per hour of work decreases by 20 percent, what will be the new levels of real GDP in the right column of A?     

Instructions: Round your answers to 2 decimal places.       

With a price level of 110, new output =  .     

With a price level of 100, new output =  .     

With a price level of 95, new output =  .     

With a price level of 90, new output =  .     

Does the new data reflect an increase in aggregate supply or does it indicate a decrease in aggregate supply?

a. Which set of data illustrates aggregate supply in the immediate short-run in North Vaudeville?     

The data in (Click to select)CAB.     

Which set of data illustrates aggregate supply in the short run in North Vaudeville?     

The data in (Click to select)ABC.     

Which set of data illustrates aggregate supply in the long run in North Vaudeville?     

The data in (Click to select)CAB.

b. Assuming no change in hours of work, if real output per hour of work decreases by 20 percent, what will be the new levels of real GDP in the right column of A?     

Instructions: Round your answers to 2 decimal places.       

With a price level of 110, new output = .     

With a price level of 100, new output = .     

With a price level of 95, new output = .     

With a price level of 90, new output = .     

Does the new data reflect an increase in aggregate supply or does it indicate a decrease in aggregate supply? (Click to select)DecreaseIncrease.

N players are bidding on an object in a first price auction. The object has a value of v_i for each player i, where v₁ > v₂> ... >v_n> 0. Each player bids secretly choosing nonnegative real number. The winner is the player who bids the largest number, and that player must pay the amount they bid. If it tie, then the player with the lowest index wins. Formulate this situation as a strategic game( describe the players, actions, and payoff functions) and show that in all the Nash equilibrium, player 1 wins the auction.

Write a program in Java that first asks the user to type in today's price of one dollar in Japanese yen, then reads U.S. dollar values and converts each to yen. Use 0 as a sentinel to denote the end of dollar input. THEN the program reads a sequence of yen amounts and converts them to dollars. The second sequence is terminated by another zero value.

PROVIDE CODE ONLY IN C++ / NO OTHER LANGUAGES

PLEASE ADD SELECTION SORT/ INSERTION SORT/ AND BUBBLE SORT FUNCTION TO THIS PROGRAM

#include <iostream>
#include<vector>
#include <algorithm >  
#include <chrono>   
#include <ctime>

using namespace std;

void bubblesSort()
{
// Please create Bubble Sort function// Make another for Selection Sort and  Insertion Sort
}

int main()
{
// empty vector
vector<int> data; // data [0], data [1]... data[N-1] <-- end(data)

// set of values to test N
for (auto N : { 20, 40, 50, 100, 120, 130, 140, 150, 200, 300, 5000, 7000 })
{
N = N * 100;
data.clear(); // wipe-out vector
data.resize(N); // resize

// anomyous/lambda function used to Generate PRN
auto random = [&N]() { return rand() % N; };

// Fill up the vector
generate(begin(data), end(data), random);

using namespace std::chrono;

// start time
auto time1 = high_resolution_clock::now();

// Call your function: bubble Sort
//sort(begin(data), end(data));

bubblesSort (data, N);

selectionSort();

insertionSort();

// end time
auto time2 = high_resolution_clock::now();

auto timeMeasure = duration_cast<milliseconds>(time2 - time1);

//
cout << "Time to sort : " << N << " number was: " << timeMeasure.count() << " milli-sec\n";

}

return 0;
}

Using the template given in ParallelMergeSort.c write the functions to divide the original array into equal fractions given the number of threads and perform Parallel MergeSort pThreads. Your algorithm should work for 2 threads.

ParallelMergeSort.c

#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <time.h>
#include <unistd.h>

#define SIZE 100

int array[SIZE];

void fillArrayWithRandomNumbers(int arr[SIZE]) {
for(int i = 0; i<SIZE; i++) array[i] = rand()%100;
}

void printArray(int arr[SIZE]) {
for(int i = 0; i<SIZE; i++) printf("%5d", arr[i]);
printf("\n");
}

typedef struct StartEndIndexes {
int start;
int end;
} StartEndIndexes;

// Runs mergesort on the array segment described in the argument. Spawns two threads to mergesort each half
// of the array segment, and then merges the results.
void* mergeSort(void* args) {

// Please fill this out!
return NULL;
}

int main() {
srand(time(0));
StartEndIndexes sei;
sei.start = 0;
sei.end = SIZE - 1;
  
// 1. Fill array with random numbers.
fillArrayWithRandomNumbers(array);
  
// 2. Print the array.
printf("Unsorted array: ");
printArray(array);
  
// 3. Create a 2 threads for merge sort.
  
// 4. Wait for mergesort to finish.
  
// 5. Print the sorted array.
printf("Sorted array: ");
printArray(array);
}

Pease fill out bolded sections!