Match these items. 1 . naturalization act stated that a foreigner had to live in the united states fourteen years to become a citizen 2 . judiciary act forced through congress by the federalists 3 . sedition act permitted the president to deport aliens whom he judged "dangerous" 4 . alien act permitted the president to imprison or deport dangerous aliens in time of war 5 . alien and sedition acts was an effort to preserve federalist principles 6 . alien enemies act authorized fines up to $5,000 and imprisonment for hindering the government

In many applications, only a small percentage of the points in a given set p of n points are extreme. in such a case, the convex hull of p has less than n vertices. this can actually make our algorithm convexhull run faster than θ(nlogn). assume, for instance, that the expected number of extreme points in a random sample of p of size r is o(rα ), for some constant α < 1. (this is true when the set p has been created by picking points uniformly at random in a ball.) prove that under this condition, the running time of the algorithm is o(n).