When do we say that a test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip?A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when 𝑝𝑝 is an infeasible test path on its own.A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when every vertex and every edge in q also occurs in 𝑝𝑝 in the same order.A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when every vertex in 𝑞𝑞 also occurs in 𝑝𝑝 in the same order.A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when every edge in 𝑞𝑞 also occurs in 𝑝𝑝 in the same order.

1 pointWhich graph coverage criterion considers writing test cases where all the simple paths of maximal length are visited? Complete path coverage. Simple path coverage. Specified path coverage. Prime path coverage.

Which of the following statements for a simple graph is correct?Group of answer choicesEvery path is a trailEvery trail is a pathEvery trail is a path as well as every path is a trailPath and trail have no relation

Which of the following statements for a simple graph is correct?Options Path and trail have no relation Every trail is a pathEvery path is a trailEvery trail is a path as well as every path is a trail

Which of the following statements for a simple graph is correct?(a) Every path is a trail(b) Every trail is a path(c) Every trail is a path as well as every path is a trail(d) Path and trail have no relation

Which of the following is an example of a testcross?Multiple choice question.AaBb x AaBbaabb x aabbAaBb x AABBAaBb x aabb