Please answer the following questions which are based on the dataset (Cars). You can only use Stata class materials or online sources. 1. What percent of sampled cars were foreign in 1978?
a. Syntax:
2. What is the mean weight of cars in 1978?
a. Syntax:
3. Compute the average prices for mpg greater than 20
a. Syntax:
4. Create a histogram for the variable mpg.
a. Syntax:
5. What are the four most expensive cars in 1978?
a. sort Syntax:
b. list Syntax:
6. Perform a regression to determine if a car’s mpg helps determine its price.
Produce an appropriate scatter plot.
a. regress Syntax:
b. scatter Syntax:
7. What happens if we add weight as an independent variable to our analysis?
a. Syntax:
8. Create a new variable efficiency that groups different levels of mpg efficiency. Assume the following: a car that gets less than 15 mpg is “inefficient”, between 15 and 30 mpg is “moderately efficient”, and above 30 mpg is “efficient”.
How many are considered “efficient”?
a. recode, gen() Syntax:
b. label variable Syntax:
c. tabulate Syntax:

just need Syntax not in prgram
just the code by STATA language

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk, thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\