Consider the following function: int FactNotFact (int N) { if (N< 0 ) { fac=-1 } else { if (N==0 || N==1){ fac=1 } else { fac=N; K=N-1; while ( k <> 0 ) { fac = fac * k; k = k – 1; } } } Fact=fac; } Answer following questions: i. Using McCabe’s cyclomatic complexity, how many paths are there in this code ii. Develop a set of tests for complete path coverage. iii. Do your tests also provide complete decision, branch and statement coverage

Which activity should be part of a long-term plan to positively affect yourhealth? oa. wearing regular clothing when handling toxinsob. not worrying about secondhand smokeoc. avoiding excessive exposure to sunlightod. drinking only well water

Write a method that takes in an array of point2d objects, and then analyzes the dataset to find points that are close together. be sure to review the point2d api. in your method, if the distance between any pair of points is less than 10, display the distance and the (x,y)s of each point. for example, "the distance between (3,5) and (8,9) is 6.40312." the complete api for the point2d adt may be viewed at ~pf/sedgewick-wayne/algs4/documentation/point2d.html (links to an external site.)links to an external site.. try to write your program directly from the api - do not review the adt's source code.

Hey i just logged on and one of the moderators deleted a bunch of my answers to questions, even though the answers were right and the people it doesn't make sense but if anyone wants to talk about anything just message me lol (this is super random lol)